Design and Analysis of Algorithms MCQ: Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

← All Design and Analysis of Algorithms questions

Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

Correct Answer: o(v2)

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Design and Analysis of Algorithms MCQs All Engineering topics Mock test hub