Intermediate Trees & Graphs

Test your Intermediate-level Data Structures Algorithms Trees Graphs skills in Computer Science Fundamentals. This timed assessment evaluates your expertise in Information Technology.

Duration: 5 minutes

•40 questions

Time Remaining: 05:00

Progress: 0%

40 questions remaining

Question 1 of 40Assessment

How does Prim's algorithm differ from Kruskal's algorithm when finding the Minimum Spanning Tree (MST) of a graph?

A. Prim's grows the MST from a starting vertex, while Kruskal's sorts and adds edges globally

B. Prim's uses a Disjoint Set Union (DSU), while Kruskal's relies exclusively on a priority queue

C. Prim's is only applicable to directed graphs, whereas Kruskal's works on undirected graphs

D. Prim's always produces a forest of trees, while Kruskal's maintains a single connected component

Keyboard Shortcuts

↑↓Navigate options

EnterSelect answer

←→Prev/Next question

SSkip question

1-4Select A-D

EscClear answer

SpaceNext question

BackspacePrevious question