MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1) |
| A. | Can be anything |
| B. | 0 |
| C. | At most 1 |
| D. | Insufficient Information |
| Answer» D. Insufficient Information | |
| 2. |
Time Complexity of Breadth First Search 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) | |
| 3. |
IN_BFS,_HOW_MANY_TIMES_A_NODE_IS_VISITED??$ |
| A. | Once |
| B. | Twice |
| C. | equivalent to number of indegree of the node |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1? |
| A. | Can be anything |
| B. | 0 |
| C. | At most 1 |
| D. | Insufficient Information |
| Answer» D. Insufficient Information | |
| 5. |
When the Breadth First Search of a graph is unique? |
| A. | When the graph is a Binary Tree |
| B. | When the graph is a Linked List |
| C. | When the graph is a n-ary Tree |
| D. | None of the mentioned |
| Answer» C. When the graph is a n-ary Tree | |
| 6. |
What can be the applications of Breadth First Search? |
| A. | Finding shortest path between two nodes |
| B. | Finding bipartiteness of a graph |
| C. | GPS navigation system |
| D. | All of the mentioned |
| Answer» E. | |
| 7. |
A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use? |
| A. | Depth First Search |
| B. | Breadth First Search |
| C. | Trim’s algorithm |
| D. | None of the mentioned |
| Answer» C. Trim‚Äö√Ñ√∂‚àö√ë‚àö¬•s algorithm | |
| 8. |
The Breadth First Search traversal of a graph will result into? |
| A. | Linked List |
| B. | Tree |
| C. | Graph with back edges |
| D. | All of the mentioned |
| Answer» C. Graph with back edges | |
| 9. |
The Data structure used in standard implementation of Breadth First Search is? |
| A. | Stack |
| B. | Queue |
| C. | Linked List |
| D. | None of the mentioned |
| Answer» C. Linked List | |
| 10. |
Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)$ |
| A. | O(V + E) |
| B. | O(V) |
| C. | O(E) |
| D. | None of the mentioned |
| Answer» B. O(V) | |
| 11. |
Breadth First Search is equivalent to which of the traversal in the Binary Trees? |
| A. | Pre-order Traversal |
| B. | Post-order Traversal |
| C. | Level-order Traversal |
| D. | In-order Traversal |
| Answer» D. In-order Traversal | |