- Computer Science Engineering (CSE)
- Data Structures (DS)
- Which of the following is useful in trav...

Q. |
## Which of the following is useful in traversing a given graph by Breath first search? |

A. | Stack. |

B. | Set. |

C. | List. |

D. | Queue. |

Answer» D. Queue. |

View all MCQs in:
Data Structures (DS)

- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
- For the given graph(G), which of the following statements is true?
- The given Graph is regular.
- Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
- What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
- The data structure required for Breadth First Traversal on a graph is?
- Breadth First search is used in____________.
- ____________ data structure is used to implement Depth First search.
- Which of the following graph traversals closely imitates level order traversal of a binary tree?

Login to Continue

It will take less than 2 minutes

Report MCQ