Time Left - 15:00 mins

GATE 2023 Algorithm Quiz 10

Attempt now to get your rank among 117 students!

Question 1

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing ?

Question 2

Apply BFS and DFS on the graph below and find how many nodes are at same position start from node A.

Question 3

Which of the following statement is true for the Bellman-Ford algorithm?

Question 4

Given a disconnected graph on 10 vertices, what is the max number of edges it can have ________.

Question 5

Consider the following graph:

What is the depth first search (DFS) sequence for the above graph?

Question 6

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph if Q is starting node.

117 attempts
0 upvotes
0 comments

Tags :

GATE & PSU CS Algorithms

Aug 25GATE & PSU CS