Top 50 Algorithms MCQs with Answers

Question 1

 External entities in DFD are shown by:-

• Ellipse

• Rectangle

• Circle

• Hexagon

Question 2

What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?

• O(n^2log(n))

• Theta(n^2log(n))

• Theta(n⁴)

• Theta(n³)

Question 3

The following statement is valid. log(n!) = [Tex]\\theta [/Tex](n log n).

• True

• False

Question 4

Which of the following is not true about comparison-based sorting algorithms?

• The minimum possible time complexity of a comparison-based sorting algorithm is O(n(log(n)) for a random input array

• Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared

• Counting Sort is not a comparison based sorting algorithm

• Heap Sort is not a comparison based sorting algorithm.

Question 5

Which of the following is not O(n²)?

• (15) * n²

• n^1.98

• n³/(sqrt(n))

• (20) * n²

Question 6

Which of the following algorithms sort n integers, having the range 0 to (n² - 1), in ascending order in O(n) time ?

• Selection sort
• Bubble sort
• Radix sort
• Insertion sort

Question 7

Which of the following algorithm design technique is used in merge sort?

• Greedy method
• Backtracking
• Dynamic programming
• Divide and Conquer

Question 8

If we use Radix Sort to sort n integers in the range (n^k/2,n^k], for some k>0 which is independent of n, the time taken would be?

• Θ(n)

• Θ(kn)

• Θ(nlogn)

• Θ(n²)

Question 9

Quick sort is run on 2 inputs shown below to sort in ascending order

A. 1, 2, 3……n
B. n, n – 1, n – 2 …… 1

Let C1 and C2 be the number of comparisons made for A and B respectively. Then

• C1 > C2

• C1 = C2

• C1 < C2 
  

• Cannot say anything for arbitrary n

Question 10

Assume that we use Bubble Sort to sort n distinct elements in ascending order. When does the best case of Bubble Sort occur?

• When elements are sorted in ascending order

• When elements are sorted in descending order

• When elements are not sorted by any order

• There is no best case for Bubble Sort. It always takes O(n*n) time