Data Structure I Practice Test 10

1. What would be the number of zeros in the adjacency matrix of the given graph?

2. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?

3. For the given graph(G), which of the following statements is true?

4. MultiGraphs having self-loops are called PseudoGraphs?

5. When is it appropriate to use direct addressing?

6. 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?

7. What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?

8. A Graph Structured Stack is a _____________

9. Every Directed Acyclic Graph has at least one sink vertex.

10. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.