Virtual Labs

1. What is incorrect about Kruskal’s algorithm?

a: Edges in MST cannot form cycles Explanation

Explanation

b: Kruskal’s algorithm uses greedy approach Explanation

Explanation

c: It makes use of disjoint set data structure Explanation

Explanation

d: MST is constructed from decreasing weighted edges Explanation

Explanation

2. In a graph having V vertices and E edges, what is the smallest possible edge count of a Minimum Spanning Tree?

a: E-1 Explanation

Explanation

b: V+1 Explanation

Explanation

c: V-1 Explanation

Explanation

d: E Explanation

Explanation

3. How do we detect whether one edge(with V1 and V2 as vertices on both the ends) is a part of a cycle in the graph?

a: V1 and V2 belong to different set in union-find Explanation

Explanation

b: V1 has smaller value than V2 Explanation

Explanation

c: V1 and V2 belong to same set in union-find Explanation

Explanation

d: V1 has larger value than V2 Explanation

Explanation

4. Which edge gets judged if it should or shouldn't be in MST after n iterations?

a: Smallest edge Explanation

Explanation

b: Largest Edge Explanation

Explanation

c: Middlemost Edge in increasing order Explanation

Explanation

d: None of the above Explanation

Explanation

5. When do we add an edge to MST while running Kruskal's ?

a: When edge forms a cycle in MST Explanation

Explanation

b: When edge doesn’t forms a cycle in MST Explanation

Explanation

c: When edge is the next smallest possible edge irrespective of the cycle Explanation

Explanation

d: None of the above Explanation

Explanation

Minimum Spanning Trees