Q101
Open questionIf a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is . . . . . . . .
Select an option to see the answer and solution.
Data Structure · all questionsGraphs
Graphs
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
153
Questions
6/8
Page
Pick an option on a question to see the right answer and solution.
Q102
Open questionHow many nodes are required to create a Binary Decision Tree having 4 variables?
Select an option to see the answer and solution.
Q103
Open questionFor some sparse graph an adjacency list is more space efficient against an adjacency matrix.
Select an option to see the answer and solution.
Q104
Open questionThe And Inverter Graph representation of a Boolean function is more efficient than the Binary Decision Diagram.
Select an option to see the answer and solution.
Q105
Open questionTo create an adjacency list C++'s map container can be used.
Select an option to see the answer and solution.
Q106
Open questionWhich of the following statements for a simple graph is correct?
Select an option to see the answer and solution.
Q107
Open questionWhat is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?
Select an option to see the answer and solution.
Q108
Open questionFor the given graph(G), which of the following statements is true?
Select an option to see the answer and solution.
Q109
Open questionGiven 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].Select an option to see the answer and solution.
Q110
Open questionA graph having an edge from each vertex to every other vertex is called a . . . . . . . .
Select an option to see the answer and solution.
Q111
Open questionTwo or more And Inverter Graphs can represent same function.
Select an option to see the answer and solution.
Q112
Open questionAnd Inverter Graph is a type of . . . . . . . .
Select an option to see the answer and solution.
Q113
Open questionWhat sequence would the BFS traversal of the given graph yield?
Select an option to see the answer and solution.
Q114
Open questionWhat would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
Select an option to see the answer and solution.
Q115
Open questionIf A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.
Select an option to see the answer and solution.
Q116
Open questionIn a Binary Decision Diagram, how many types of terminal exists?
Select an option to see the answer and solution.
Q117
Open questionEvery Binary Decision Diagram is also a Propositional Directed Acyclic Graph.
Select an option to see the answer and solution.
Q118
Open questionIn the following DAG find out the number of required Stacks in order to represent it in a Graph Structured Stack.
Select an option to see the answer and solution.
Q119
Open questionComplete 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];Select an option to see the answer and solution.
Q120
Open questionIn a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
Select an option to see the answer and solution.