ISRO Quiz 2023 32

Header files include ______.

The expression 5 – 2 – 3 * 5 – 2 will evaluate to 18, if:

Assume that enqueuing and dequeuing operation take O(V) time each, during BFS algorithm on a graph. What would be the worst-case time complexity of BFS algorithm? (V is the number of vertices in the graph and graph is given as input to BFS [Breadth First Search] in the form of adjacency list).

Tower of Hanoi uses _______.

Select the option in which the given figure is embedded. (Rotation is NOT allowed)