MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 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>) | |