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. What is the time complexity of Prim’s Algorithm? (Let V be the number of vertices, E be the number of edges)

a: O(Vlog(V)+Elog(E)) Explanation

Explanation

b: O((V+E)log(E)) Explanation

Explanation

c: O(Elog(V)+Elog(E)) Explanation

Explanation

d: O((V+E)log(V)) Explanation

Explanation

2. What is the best case time complexity of Prim’s Algorithm? (Let V be the number of vertices, E be the number of edges)

a: O(V^2) Explanation

Explanation

b: Somewhere in between O(V) and O(V^2) Explanation

Explanation

c: O(V) Explanation

Explanation

d: None of the above Explanation

Explanation

3. Prim’s algorithm is similar to Dijkstra Algorithm

a: True Explanation

Explanation

b: False Explanation

Explanation

4. Upon using the adjacency matrix, what is the worst case time complexity of Prim’s Algorithm? (Let V be the number of vertices, E be the number of edges)

a: O(V^2) Explanation

Explanation

b: O(Vlog(V)) Explanation

Explanation

c: O(Elog(V)) Explanation

Explanation

d: O(V+E^2) Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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