Multiple Choice Questions On Graph Data Structures | letsbug

 MCQs On Graphs Data - Structure

1. A graph is a collection of ____.

1.  Rows and columns
2.  Vertices and edges
3.  Equations
4.  None of these

Answer: 2 : Vertices and edges

2. The degree of any vertex of graph is ____.

1. The number of incident with vertex
2.  Number of vertex in a graph
3.  Number of vertices adjacent to that vertex
4.  Number of edges in a graph

Answer: 1 : The number of incident with vertex

3. A vertex with degree one in a graph in called _____.

1.  A leaf
2.  Pendant vertex 
3.  Adjacency list
4.  None

Answer: 2 : Pendant vertex

4. The maximum degree of any vertex in a simple graph with n vertices is _____.

1. n - 1
2. n + 1
3. 2n - 1
4. N

Answer: 1 : n - 1

5. the number of distinct simple graph with upto 3 nodes is _____.

1. 15
2. 10
3. 7
4. 9

Answer: 1 : 15

6. Which of the following ways can be use to represent a graph? 

1. Adjacency Matrix
2. Adjacency list
3. Adjacency multi-list
4. All of the above

Answer: 4 : All of the above

7. The data structure used in standard implementation of a Breadth First Search is?

1. Stack 
2. Queue
3. LInked list
4. Tree

Answer: 2 : Queue

8. Depth First Search is equivalent to which of the treversal in the Binary Tree?

1. Pre-order Traversal
2. Post-order Traversal
3. Level-order Traversal
4. In-order Traversal 

Answer: 1 : Pre-order Traversal

9. The Data structure used in standard implementation of Depth First Search is? 

1. Stack 
2. Queue
3. Linked list
4. Tree

Answer: 1 : Stack

10. In the most of the cases, topological sort starts from a node which has _____.

1. Maximum Degree
2. Minimum Degree
3. Any degree
4. Zero Degree

Answer: 4 : Zero Degree