In which case adjacency list is preferred in front of an adjacency matrix?
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
4/8
Page
Pick an option on a question to see the right answer and solution.
In which of the following case does a Binary Decision Diagram is used for?
Select an option to see the answer and solution.
A Graph Structured Stack is a . . . . . . . .
Select an option to see the answer and solution.
In a Binary Decision Diagrams 0 values by a . . . . . . . . line and the 1 values are represented by a . . . . . . . . line.
Select an option to see the answer and solution.
What would be the time complexity of the BFS traversal of a graph with n vertices and n1.25 edges?
Select an option to see the answer and solution.
Which of the following ways can be used to represent a graph?
Select an option to see the answer and solution.
All trees with n vertices consists of n-1 edges.
Select an option to see the answer and solution.
Binary Decision Diagram is a type of . . . . . . . .
Select an option to see the answer and solution.
A graph with all vertices having equal degree is known as a . . . . . . . .
Select an option to see the answer and solution.
In a Propositional Directed Acyclic Graph Leaves maybe labelled with a boolean variable.
Select an option to see the answer and solution.
The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is . . . . . . . .
Select an option to see the answer and solution.
What is the degree sequence of the given HyperGraph, in non-increasing order.
V = {v1,v2,v3,v4,v5,v6} E = {{v1,v4,v5} {v2,v3,v4,v5} {v2} {v1} {v1,v6}}
V = {v1,v2,v3,v4,v5,v6} E = {{v1,v4,v5} {v2,v3,v4,v5} {v2} {v1} {v1,v6}}
Select an option to see the answer and solution.
Given Adjacency matrices determine which of them are PseudoGraphs?
i. {{1,0} {0,1}}
ii. {{0,1}{1,0}}
iii. {{0,0,1}{0,1,0}{1,0,0}}
i. {{1,0} {0,1}}
ii. {{0,1}{1,0}}
iii. {{0,0,1}{0,1,0}{1,0,0}}
Select an option to see the answer and solution.
Time complexity to find if there is an edge between 2 particular vertices is . . . . . . . .
Select an option to see the answer and solution.
What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
Select an option to see the answer and solution.
What would be the number of zeros in the adjacency matrix of the given graph?
Select an option to see the answer and solution.
For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
Select an option to see the answer and solution.
What would be the DFS traversal of the given Graph?
Select an option to see the answer and solution.
Which of the given statement is true?
Select an option to see the answer and solution.
In which of the following does a Directed Acyclic Word Graph finds its application in?
Select an option to see the answer and solution.