Graph Data Structure MCQs With Answers
By Aniket Singh
·Published
·Updated
·A short read
MCQs On Graphs Data - Structure
1. A graph is a collection of ____.
- Rows and columns
- Vertices and edges
- Equations
- None of these
Answer: 2 : Vertices and edges
2. The degree of any vertex of graph is ____.
- The number of incident with vertex
- Number of vertex in a graph
- Number of vertices adjacent to that vertex
- 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 _____.
- A leaf
- Pendant vertex
- Adjacency list
- None
Answer: 2 : Pendant vertex
4. The maximum degree of any vertex in a simple graph with n vertices is _____.
Answer: 1 : n - 1
5. the number of distinct simple graph with upto 3 nodes is _____.
Answer: 1 : 15
6. Which of the following ways can be use to represent a graph?
- Adjacency Matrix
- Adjacency list
- Adjacency multi-list
- All of the above
Answer: 4 : All of the above
7. The data structure used in standard implementation of a Breadth First Search is?
- Stack
- Queue
- LInked list
- Tree
Answer: 2 : Queue
8. Depth First Search is equivalent to which of the treversal in the Binary Tree?
- Pre-order Traversal
- Post-order Traversal
- Level-order Traversal
- In-order Traversal
Answer: 1 : Pre-order Traversal
9. The Data structure used in standard implementation of Depth First Search is?
- Stack
- Queue
- Linked list
- Tree
Answer: 1 : Stack
10. In the most of the cases, topological sort starts from a node which has _____.
- Maximum Degree
- Minimum Degree
- Any degree
- Zero Degree
Answer: 4 : Zero Degree