graph

What would be the DFS traversal of the given Graph?

• ABCED

• AEDCB

• EDCBA

• ADECB

Which of these adjacency matrices represents a simple graph?

• [ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]

• [ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]

• [ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]

• [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

n the given graph, how many intermediate vertices are required to travel from node a to node e at a minimum cost?

• 2

• 1

• 0

• 3

Which of the following is false in the case of a spanning tree of a graph G?

• a) It is tree that spans G

• b) It is a subgraph of the G

• c) It includes every vertex of the G

• d) It can be either cyclic or acyclic

1. Floyd Warshall’s Algorithm is used for solving ____________

• a) All pair shortest path problems

• b) Single Source shortest path problems

• c) Network flow problems

• d) Sorting problems

Dijkstra’s Algorithm is the prime example for ___________

• a) Greedy algorithm

• b) Branch and bound

• c) Back tracking

• d) Dynamic programming

Given pseudo code of Dijkstra’s Algorithm.

What happens when “While Q != 0” is changed to “while Q>1”?

• a) While loop gets executed for v times

• b) While loop gets executed for v-1 times

• c) While loop gets executed only once

• d) While loop does not get executed

Dijkstra’s Algorithm cannot be applied on ______________

• a) Directed and weighted graphs

• b) Graphs having negative weight function

• c) Undirected and unweighted graphs

• d) none

. Dijkstra’s Algorithm is used to solve _____________ problems.

• a) All pair shortest path

• b) Single source shortest path

• c) Network flow

• d) Sorting

Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?

• Max priority queue

• stack

• circular queue

• min priority queue