MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 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. |
Topological sorting of a graph represents _______ of a graph. |
| A. | linear probing |
| B. | linear ordering |
| C. | quadrilateral ordering |
| D. | insertion sorting |
| Answer» C. quadrilateral ordering | |
| 2. |
The time complexity to find shortest distances by using Dijkstra’s algorithm is __________ |
| A. | O(E2) |
| B. | O(V+1-E) |
| C. | O(V+E) |
| D. | O(E+VlogV) |
| Answer» E. | |
| 3. |
The time complexity to find a Eulerian path in a graph of vertex V and edge E is _____________ |
| A. | O(V2) |
| B. | O(V+E-1) |
| C. | O(V+E) |
| D. | O(E+1) |
| Answer» D. O(E+1) | |
| 4. |
How many cycles are there in a wheel graph of order 5? |
| A. | 6 |
| B. | 10 |
| C. | 25 |
| D. | 7 |
| Answer» E. | |
| 5. |
How many edges are there in a complete graph of order 9? |
| A. | 35 |
| B. | 36 |
| C. | 45 |
| D. | 19 |
| Answer» C. 45 | |
| 6. |
What is a separable graph? |
| A. | A disconnected graph by deleting a vertex |
| B. | A disconnected graph by removing an edge |
| C. | A disconnected graph by removing one edge and a vertex |
| D. | A simple graph which does not contain a cycle |
| Answer» B. A disconnected graph by removing an edge | |
| 7. |
If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________ |
| A. | the degree of each vertex is at most n/2 |
| B. | the degree of each vertex is equal to n |
| C. | the degree of every vertex is at least n+1/2 |
| D. | the degree of every vertex in G is at least n/2 |
| Answer» E. | |
| 8. |
A binary cycle space forms a ______ over the two element field. |
| A. | triangular graph |
| B. | vector space |
| C. | binary tree |
| D. | hamiltonian graph |
| Answer» C. binary tree | |
| 9. |
For an n-vertex undirected graph, the time required to find a cycle is ____________ |
| A. | O(n) |
| B. | O(n2) |
| C. | O(n+1) |
| D. | O(logn) |
| Answer» B. O(n2) | |
| 10. |
If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______ |
| A. | m+n-1 |
| B. | m-n |
| C. | m*n |
| D. | m*n+1 |
| Answer» D. m*n+1 | |