MCQOPTIONS
Bookmark
Saved Bookmarks
→
Prims Algorithm Multiple Choice
→
General
→
Prim s algorithm resembles Dijkstra s algorithm.
1.
Prim s algorithm resembles Dijkstra s algorithm.
A.
True
B.
False
Answer» B. False
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following is false about Prim s algorithm?
Prim s algorithm can be efficiently implemented using _____ for graphs with greater density.
Prim s algorithm is also known as __________
Kruskal s algorithm is best suited for the sparse graphs than the prim s algorithm.
Prim s algorithm resembles Dijkstra s algorithm.
Prim s algorithm is a ______
Worst case is the worst case time complexity of Prim s algorithm if adjacency matrix is used?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
