MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Minimum Cut Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The running time of implementing na ve solution to min-cut problem is? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(log N) |
| D. | O(N<sup>2</sup>) |
| Answer» E. | |
| 2. |
What is the running time of Karger s algorithm to find the minimum cut in a graph? |
| A. | O(E) |
| B. | O(|V|<sup>2</sup>) |
| C. | O(V) |
| D. | O(|E|) |
| Answer» C. O(V) | |
| 3. |
What is the minimum number of cuts that a graph with n vertices can have? |
| A. | n+1 |
| B. | n(n-1) |
| C. | n(n+1)/2 |
| D. | n(n-1)/2 |
| Answer» D. n(n-1)/2 | |