MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What would be the time complexity of the BFS traversal of a graph with n vertices and n1.25 edges? |
| A. | O(n) |
| B. | O(n<sup>1.25</sup>) |
| C. | O(n<sup>2.25</sup>) |
| D. | O(n*n) |
| Answer» C. O(n<sup>2.25</sup>) | |
| 2. |
To create an adjacency list C++ s map container can be used. |
| A. | True |
| B. | False |
| Answer» B. False | |