| 81. | What are the dimensions of an incidence matrix? |
|
Answer: (b).Number of edges*number of vertices
|
| 82. | The column sum in an incidence matrix for a directed graph having no self loop is __________ |
|
Answer: (a).0
|
| 83. | Time complexity to check if an edge exists between two vertices would be ___________ |
|
Answer: (d).O(E)
|
| 84. | The graphs G1 and G2 with their incidences matrices given are Isomorphic. e1 e2 e3 e4 e5 e6 v1 1 0 0 0 0 0 v2 1 1 0 0 0 1 v3 0 1 1 0 1 0 v4 0 0 1 1 0 0 v5 0 0 0 1 1 1 e1 e2 e3 e4 e5 e6 v1 0 0 1 0 0 0 v2 1 0 1 0 1 0 v3 1 1 0 1 0 0 v4 0 1 0 0 0 1 v5 0 0 0 1 1 1 |
|
Answer: (a).True
|
| 85. | If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix? |
|
Answer: (a).n-1
|
| 86. | A Graph Structured Stack is a _____________ |
|
Answer: (c).Directed Acyclic Graph
|
| 87. | If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC? |
|
Answer: (c).Source – 1, 8 Sink – 4
|
| 88. | Graph Structured Stack finds its application in _____________ |
|
Answer: (b).Tomita’s Algorithm
|
| 89. | If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M. |
|
Answer: (b).False
|
| 90. | Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________ |
|
Answer: (c).O(E+V)
|
