MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
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. |
The time complexity to find shortest distances by using Dijkstra s algorithm is __________ |
| A. | O(E<sup>2</sup>) |
| B. | O(V+1-E) |
| C. | O(V+E) |
| D. | O(E+VlogV) |
| Answer» E. | |
| 2. |
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. | |