MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the minimum cut of the following network? |
| A. | ({1,3},{4,3},{4,5}) |
| B. | ({1,2},{2,3},{4,5}) |
| C. | ({1,0},{4,3},{4,2}) |
| D. | ({1,2},{3,2},{4,5}) |
| Answer» B. ({1,2},{2,3},{4,5}) | |
| 2. |
What is the running time of Karger’s algorithm to find the minimum cut in a graph? |
| A. | O(E) |
| B. | O(|V|2) |
| 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 | |
| 4. |
What does the given figure depict? |
| A. | min cut problem |
| B. | max cut problem |
| C. | maximum flow problem |
| D. | flow graph |
| Answer» B. max cut problem | |