Discover
Questions library
Collections library
Find online teacher
login
Discover
questions library
Find online teacher
login
Popular Searches:
class-diagram
Polymorphism
flowchart
if-else
Home
Questions
Algorithms
Algorithms MCQ Questions
Post A Question
Classifications:
Algorithms Assignments
Algorithms examples
MCQ Questions Categories:
Medicine MCQ Questions
Networks MCQ Questions
Java programming MCQ Questions
C++ programming MCQ Questions
C programming MCQ Questions
c# programming MCQ Questions
Python programming MCQ Questions
Database MCQ Questions
Php programming MCQ Questions
Show Collections (0)
Show Questions (20)
No collections found!
Dijkstra’s algorithm is based on
YasminRadwan26
2022-05-30
1 answers
548 Views
0 Likes
Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph?
YasminRadwan26
2022-05-30
1 answers
245 Views
0 Likes
A problem in NP is NP-complete
YasminRadwan26
2022-05-30
1 answers
243 Views
0 Likes
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
YasminRadwan26
2022-05-30
1 answers
276 Views
0 Likes
Which of the following statements is TRUE?
YasminRadwan26
2022-05-30
1 answers
237 Views
0 Likes
An unordered list contains n distinct elements
YasminRadwan26
2022-05-30
1 answers
244 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?
YasminRadwan26
2022-05-30
1 answers
204 Views
0 Likes
The time complexity of an algorithm to compute M1 × M2 will be
YasminRadwan26
2022-05-30
1 answers
552 Views
0 Likes
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is
YasminRadwan26
2022-05-30
1 answers
227 Views
0 Likes
Which of the following sorting algorithms has the lowest worst-case complexity?
YasminRadwan26
2022-05-30
1 answers
257 Views
0 Likes
The worst case running time of this computation is
YasminRadwan26
2022-05-30
1 answers
216 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
YasminRadwan26
2022-05-30
1 answers
265 Views
0 Likes
What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?
YasminRadwan26
2022-05-30
1 answers
553 Views
0 Likes
Show More