# Algorithms MCQ Questions

Post A Question

Classifications:

MCQ Questions Categories:

No collections found!

###### Dijkstra’s algorithm is based on 1 answers 325 Views 0 Likes
###### Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph? 1 answers 146 Views 0 Likes
###### A problem in NP is NP-complete 1 answers 145 Views 0 Likes
###### The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are: 1 answers 182 Views 0 Likes
###### Which of the following statements is TRUE? 1 answers 144 Views 0 Likes
###### An unordered list contains n distinct elements 1 answers 159 Views 0 Likes
###### Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort? 1 answers 130 Views 0 Likes
###### The time complexity of an algorithm to compute M1 × M2 will be 1 answers 334 Views 0 Likes
###### The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is 1 answers 145 Views 0 Likes
###### Which of the following sorting algorithms has the lowest worst-case complexity? 1 answers 169 Views 0 Likes
###### The worst case running time of this computation is 1 answers 133 Views 0 Likes
###### The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of 1 answers 181 Views 0 Likes
###### What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices? 1 answers 336 Views 0 Likes