Explore topic-wise MCQs in General Awareness.

This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.

1.

Prim’s algorithm can be efficiently implemented using _____ for graphs with greater density.

A. d-ary heap
B. linear search
C. fibonacci heap
D. binary search
Answer» B. linear search
Discussion
2.

Prim’s algorithm is also known as __________

A. Dijkstra–Scholten algorithm
B. Borůvka’s algorithm
C. Floyd–Warshall algorithm
D. DJP Algorithm
Answer» E.
Discussion
3.

Consider the graph shown below.

A. Which of the following edges form the MST of the given graph using Prim’a algorithm, starting from vertex 4.
B. (4-3)(5-3)(2-3)(1-2)
C. (4-3)(3-5)(5-1)(1-2)
D. (4-3)(3-5)(5-2)(1-5)
E. (4-3)(3-2)(2-1)(1-5)
Answer» E. (4-3)(3-2)(2-1)(1-5)
Discussion
4.

Prim’s algorithm resembles Dijkstra’s algorithm.

A. True
B. False
Answer» B. False
Discussion
5.

Prim’s algorithm is a ______

A. Divide and conquer algorithm
B. Greedy algorithm
C. Dynamic Programming
D. Approximation algorithm
Answer» C. Dynamic Programming
Discussion
6.

Consider the given graph.

A. What is the weight of the minimum spanning tree using the Prim’s algorithm,starting from vertex a?
B. 23
C. 28
D. 27
E. 11
Answer» D. 27
Discussion