Top MCQs on Algorithms | DSA Quiz for Beginners

Question 1

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

• Insertion sort

• selection sort

• Merge sort

• Quick sort

Question 2

What is the worst-case complexity of Selection sort algorithm?

• O(n)

• O(n^2)

• O(n log(n))

• none

Question 3

what is the time complexity of the best sorting algorithms?

• O(n)

• O(n log(n))

• O(n^2)

• none

Question 4

Which of the following sorting algorithms has the worst time complexity for most inputs?

• Quick sort

• Merge sort

• Bubble sort

• None

Question 5

Which of the following is not a stable sorting algorithm in its typical implementation?

• Quick sort

• Bubble Sort

• Merge sort

• selection sort

Question 6

What is the best case for linear search?

• O(logn)

• O(n)

• O(1)

• O(nlogn)

Question 7

What is the time complexity of binary search with iteration?

• O(logn)

• O(n)

• O(n^2)

• None

Question 8

what is the condition for applying binary search?

• data is not sorted

• data must be sorted

• Either A  or B

• None

Question 9

What is the operator used to make 2's Two's compliment.?

• & Bitwise AND Operator 
  

• | Bitwise OR operator

• ~ Bitwise Negate Operator

• ^ Bitwise Exclusive OR

Question 10

What is a Single Operand Operator below.?

• & Bitwise AND Operator 
  

• | Bitwise OR operator

• ^ Bitwise Exclusive OR

• ~ Bitwise Negate Operator