HOME
PARTNERS
CONTACT

Computer Science and Engineering Data Structures – 2 Experiments

Aim

Overview

Recap

Recap: Algorithm

Pretest

MST

Aim Overview

Kruskals Algorithm

Aim Concept Algorithm Demo Practice Exercise Quiz

Analysis of Kruskals

Aim Time and Space Complexity Quiz

Prims Algorithm

Aim Concept Algorithm Demo Practice Exercise Quiz

Analysis of Prims

Aim Time and Space Complexity Comparison with Kruskals and Others Quiz

Posttest

Minimum Spanning Trees

Choose difficulty:

Beginner

Intermediate

Advanced

1. When do we add a vertex, adjacent to a newly added vertex to MST, into Min-heap?

a: If it is present in Min-heap Explanation

Explanation

b: If it is neither in MST nor in Min-heap. Explanation

Explanation

c: If it is present in MST Explanation

Explanation

d: If it is present in both Min-heap and MST Explanation

Explanation

2. How many edges are present in MST after k iterations?

a: Exactly K Explanation

Explanation

b: Less than equal to K Explanation

Explanation

c: Greater than equal to K Explanation

Explanation

d: Can’t Say Explanation

Explanation

3. For dense graphs, which data structure can be used to implement Prim’s Algorithm?

a: Fibonacci Heap Explanation

Explanation

b: Stack Explanation

Explanation

c: D-Heap Explanation

Explanation

d: Linked List Explanation

Explanation

4. Select a false statement.

a: Heap can be used to implement Prim’s Algorithm Explanation

Explanation

b: Prim’s algorithm spans from one vertex to another Explanation

Explanation

c: Prim’s algorithm is an example of greedy algorithm Explanation

Explanation

d: Cycles in MST can get accepted by Prim’s Algorithm Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)