61. In which case adjacency list is preferred in front of an adjacency matrix?
62. In which of the following case does a Binary Decision Diagram is used for?
63. A Graph Structured Stack is a . . . . . . . .
64. In a Binary Decision Diagrams 0 values by a . . . . . . . . line and the 1 values are represented by a . . . . . . . . line.
65. What would be the time complexity of the BFS traversal of a graph with n vertices and n1.25 edges?
66. Which of the following ways can be used to represent a graph?
67. All trees with n vertices consists of n-1 edges.
68. Binary Decision Diagram is a type of . . . . . . . .
69. A graph with all vertices having equal degree is known as a . . . . . . . .
70. In a Propositional Directed Acyclic Graph Leaves maybe labelled with a boolean variable.
Read More Section(Graphs)
Each Section contains maximum 100 MCQs question on Graphs. To get more questions visit other sections.