Explore topic-wise MCQs in Discrete Mathematics.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.

1.

Prim s algorithm can be implemented using _______

A. a stack data structure
B. radix sort
C. priority queue data structure
D. bubble sort
Answer» D. bubble sort
Discussion
2.

Time complexity of Prim s algorithm is _________

A. O((V+E)logV)
B. O(E+V)
C. O(E)
D. O(V+1)
Answer» B. O(E+V)
Discussion