Datastructures - Graph Traversals


Question 1     

The Breadth First Search of a graph will result into?






Question 2     

How many 1's are present in an adjacency matrix of a simple graph with n vertices?






Question 3     

Which data structure is used for BFS






Question 4     

DFS is a generalization of which of the following tree traversal techniques?







Question 6     

All the vertices in a graph are visited with BFS in an undirected Graph





Question 8     

Which data structure is best suitable for DFS?







Question 10     

How many times each node is visited in BFS?






Sign Up Page

Oops!!

To view the solution need to Login



Score : 0 / 0
L
o
a
d
i
n
g
.
.
.