1. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is . . . . . . . .
2. How many nodes are required to create a Binary Decision Tree having 4 variables?
3. For some sparse graph an adjacency list is more space efficient against an adjacency matrix.
4. The And Inverter Graph representation of a Boolean function is more efficient than the Binary Decision Diagram.
5. To create an adjacency list C++'s map container can be used.
6. Which of the following statements for a simple graph is correct?
7. What is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?
8. For the given graph(G), which of the following statements is true?
9. Given the following adjacency matrix of a graph(G) determine the number of components in the G.
[0 1 1 0 0 0],
[1 0 1 0 0 0],
[1 1 0 0 0 0],
[0 0 0 0 1 0],
[0 0 0 1 0 0],
[0 0 0 0 0 0].
[0 1 1 0 0 0],
[1 0 1 0 0 0],
[1 1 0 0 0 0],
[0 0 0 0 1 0],
[0 0 0 1 0 0],
[0 0 0 0 0 0].10. A graph having an edge from each vertex to every other vertex is called a . . . . . . . .
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.