Question 21 : Prim's algorithm resembles Dijkstra's algorithm.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 22 : Kruskal's algorithm is a ______
1. divide and conquer algorithm
2. dynamic programming algorithm
3. greedy algorithm
4. approximation algorithm
View Answer   Discuss with Members

Question 23 : Prim's algorithm is also known as __________
1. Dijkstra-Scholten algorithm
2. Borůvka's algorithm
3. Floyd-Warshall algorithm
4. DJP Algorithm
View Answer   Discuss with Members

Question 24 : Every graph has only one minimum spanning tree.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 25 : Can child node be always called Leaf node in the K-ary tree?
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 26 : What is the time complexity for storing the maximum number of elements in Van Emde Boas tree if M is the maximum number of elements?
1. O (log M)
2. O (M!)
3. O (M)
4. O (1)
View Answer   Discuss with Members

Question 27 : In which year was Van Emde Boas tree invented?
1. 1972
2. 1973
3. 1974
4. 1975
View Answer   Discuss with Members

Question 28 : How many child nodes does each node of K-ary Tree contain?
1. 2
2. 3
3. more than k
4. at most k
View Answer   Discuss with Members

Question 29 : Does path compression algorithm work during?
1. Create operation
2. Insert operation
3. Find operation
4. Delete operation
View Answer   Discuss with Members

Question 30 : Who Invented The vEB also known as Van Emde Boas Tree?
1. Peter Van Emde Boas
2. Samuel F. B. Morse
3. Friedrich Clemens Gerke
4. Alexander Morse
View Answer   Discuss with Members