MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 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. |
Choose the incorrect statement about DFS and BFS from the following? |
| A. | BFS is equivalent to level order traversal in trees |
| B. | DFS is equivalent to post order traversal in trees |
| C. | DFS and BFS code has the same time complexity |
| D. | BFS is implemented using queue |
| Answer» C. DFS and BFS code has the same time complexity | |
| 2. |
Which of the following data structure is used to implement BFS? |
| A. | linked list |
| B. | tree |
| C. | stack |
| D. | queue |
| Answer» E. | |
| 3. |
What is the space complexity of standard DFS(V: no. of vertices E: no. of edges)? |
| A. | O(V+E) |
| B. | O(V) |
| C. | O(E) |
| D. | O(V*E) |
| Answer» C. O(E) | |
| 4. |
What will be the time complexity of the iterative depth first traversal code(V=no. of vertices E=no.of edges)? |
| A. | O(V+E) |
| B. | O(V) |
| C. | O(E) |
| D. | O(V*E) |
| Answer» B. O(V) | |
| 5. |
Which of the following is a possible result of depth first traversal of the given graph(consider 1 to be source element)? |
| A. | 1 2 3 4 5 |
| B. | 1 2 3 1 4 5 |
| C. | 1 4 5 3 2 |
| D. | 1 4 5 1 2 3 |
| Answer» B. 1 2 3 1 4 5 | |
| 6. |
What will be the result of depth first traversal in the following tree? |
| A. | 4 2 5 1 3 |
| B. | 1 2 4 5 3 |
| C. | 4 5 2 3 1 |
| D. | 1 2 3 4 5 |
| Answer» C. 4 5 2 3 1 | |
| 7. |
Which of the following traversal in a binary tree is similar to depth first traversal? |
| A. | level order |
| B. | post order |
| C. | pre order |
| D. | in order |
| Answer» D. in order | |
| 8. |
Which of the following data structure is used to implement DFS? |
| A. | linked list |
| B. | tree |
| C. | stack |
| D. | queue |
| Answer» D. queue | |