BitQit interview questions

Preview Questions

1. Implement binary search (with time complexity)

   Binary Search Algorithm Time Complexity: O(log n) BinarySearch(arr, target): left = 0 right = length(arr) - 1 while left <= right: mid = (left + right) // 2 if arr[mid] == target: return mid if arr[mid] < target: left =...

2. Implement for Bubble / Merge / Quick sort.

   Bubble Sort : https://www.geeksforgeeks.org/problems/bubble-sort/1 Merge Sort : https://www.geeksforgeeks.org/problems/merge-sort/1 Quick Sort : https://www.geeksforgeeks.org/problems/quick-sort/1

3. Write a recursive function for factorial or Fibonacci.

   Factorial of n (denoted n !) is the product of all positive integers up to n. Base case is : 0! = 1. def factorial(n): if n == 0 or n == 1: return 1 else: return n * factorial(n - 1) # Example: print(factorial(5)) #...

4. Explain the OSI model and its layers.

   The OSI (Open Systems Interconnection) Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven distinct layers. It helps different systems communicate over a...

5. What is Error handling in JavaScript.

   Error handling in JavaScript is primarily done using the try...catch...finally construct. The try block contains code that may throw an error. If an error occurs, the control shifts to the catch block where the error...

6. What is IIFE ? Provide an example ?

   An IIFE (Immediately Invoked Function Expression) in JavaScript is a function that runs as soon as it is defined. It is written as a function expression enclosed in parentheses, followed by another pair of parentheses...