MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following is not an application of topological sorting? |
| A. | Finding prerequisite of a task |
| B. | Finding Deadlock in an Operating System |
| C. | Finding Cycle in a graph |
| D. | Ordered Statistics |
| Answer» E. | |
| 2. |
In most of the cases, topological sort starts from a node which has __________ |
| A. | Maximum Degree |
| B. | Minimum Degree |
| C. | Any degree |
| D. | Zero Degree |
| Answer» E. | |
| 3. |
Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges) |
| A. | O(V + E) |
| B. | O(V) |
| C. | O(E) |
| D. | O(V*E) |
| Answer» B. O(V) | |