Explore topic-wise MCQs in Testing Subject.

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

1.

Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?

A. (B-E)(G-E)(E-F)(D-F)
B. (B-E)(G-E)(E-F)(B-G)(D-F)
C. (B-E)(G-E)(E-F)(D-E)
D. (B-E)(G-E)(E-F)(D-F)(D-G)
Answer» B. (B-E)(G-E)(E-F)(B-G)(D-F)
Discussion
2.

Kruskal’s algorithm is a ______

A. divide and conquer algorithm
B. dynamic programming algorithm
C. greedy algorithm
D. approximation algorithm
Answer» D. approximation algorithm
Discussion
3.

Kruskal’s algorithm is used to ______

A. find minimum spanning tree
B. find single source shortest path
C. find all pair shortest path algorithm
D. traverse the graph
Answer» B. find single source shortest path
Discussion
Previous Next