11. Two or more And Inverter Graphs can represent same function.
12. And Inverter Graph is a type of . . . . . . . .
13. What sequence would the BFS traversal of the given graph yield?
14. 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?
15. If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.
16. In a Binary Decision Diagram, how many types of terminal exists?
17. Every Binary Decision Diagram is also a Propositional Directed Acyclic Graph.
18. In the following DAG find out the number of required Stacks in order to represent it in a Graph Structured Stack.
19. Complete the given snippet of code for the adjacency list representation of a weighted directed graph.
class neighbor
{
int vertex, weight;
____ next;
}
class vertex
{
string name;
_____ adjlist;
}
vertex adjlists[101];
class neighbor
{
int vertex, weight;
____ next;
}
class vertex
{
string name;
_____ adjlist;
}
vertex adjlists[101];20. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.