MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 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» E. | |
| 2. |
In a maximum spanning tree the weighted graph is of _______ |
| A. | maximum number of edges |
| B. | maximum number of cyclic trees |
| C. | minimum number of vertices |
| D. | maximum weight |
| Answer» B. maximum number of cyclic trees | |
| 3. |
The spanning tree will be maximally acyclic if ____________ |
| A. | one additional edge makes a cycle in the tree |
| B. | two additional edges makes a cycle in the tree |
| C. | removing one edge makes the tree cycle free |
| D. | removing two edges make the tree cycle free |
| Answer» C. removing one edge makes the tree cycle free | |
| 4. |
A complete undirected graph of n nodes can have maximum ______ spanning trees. |
| A. | nn+1 |
| B. | nn-2 |
| C. | \(\frac{n(n+1)}{2}\) |
| D. | n |
| Answer» D. n | |
| 5. |
If minimum cost edge of a graph is unique, then that edge will be added to any MST. Choose the correct option. |
| A. | false |
| B. | maximum cost edge is added |
| C. | true |
| D. | minimum cost edge need not be unique |
| Answer» C. true | |
| 6. |
An immediate application of minimum spanning tree ______ |
| A. | gesture analysis |
| B. | handwriting recognition |
| C. | fingerprint detection |
| D. | soft computing |
| Answer» C. fingerprint detection | |
| 7. |
What is the time complexity of Kruskal’s algorithm? |
| A. | O(ElogV) |
| B. | O(V+logE) |
| C. | O(E+1) |
| D. | O(V2) |
| Answer» B. O(V+logE) | |
| 8. |
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) | |
| 9. |
For every spanning tree with n vertices and n edges what is the least number of different Spanning trees can be formed? |
| A. | 2 |
| B. | 5 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 10. |
If the weight of an edge e of cycle C in a graph is larger than the individual weights of all other edges of C, then that edge ________ |
| A. | belongs to an minimum spanning tree |
| B. | cannot belong to an minimum spanning tree |
| C. | belongs to all MSTs of the graph |
| D. | can not belong to the graph |
| Answer» C. belongs to all MSTs of the graph | |
| 11. |
Spanning trees have a special class of depth-first search trees named _________ |
| A. | Euclidean minimum spanning trees |
| B. | Tremaux trees |
| C. | Complete bipartite graphs |
| D. | Decision trees |
| Answer» C. Complete bipartite graphs | |