Algorithms MCQ Questions

Post A Question

Classifications:

MCQ Questions Categories:

No collections found!

Dijkstra’s algorithm is based on
icon 1 answers
icon641 Views
icon0 Likes
Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph?
icon 1 answers
icon285 Views
icon0 Likes
A problem in NP is NP-complete
icon 1 answers
icon289 Views
icon0 Likes
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
icon 1 answers
icon330 Views
icon0 Likes
Which of the following statements is TRUE?
icon 1 answers
icon281 Views
icon0 Likes
An unordered list contains n distinct elements
icon 1 answers
icon288 Views
icon0 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?
icon 1 answers
icon248 Views
icon0 Likes
The time complexity of an algorithm to compute M1 × M2 will be
icon 1 answers
icon653 Views
icon0 Likes
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is
icon 1 answers
icon272 Views
icon0 Likes
Which of the following sorting algorithms has the lowest worst-case complexity?
icon 1 answers
icon296 Views
icon0 Likes
The worst case running time of this computation is
icon 1 answers
icon259 Views
icon0 Likes
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of
icon 1 answers
icon307 Views
icon0 Likes
What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?
icon 1 answers
icon651 Views
icon0 Likes