Graph MCQ - 1

Graph MCQ - 1

1- Which of the following data structure is nonlinear type? 

A). Strings 

B). Lists 

C). Stacks 

D). Graph

2- Which of the following is nonlinear data structure? 

A). Stacks 

B). List 

C). Strings 

D). Trees 

Herder node is used as sentinel in ….. 

A). Graphs 

B). Stacks 

C). Binary tree 

D). Queues 

3- Which of the following statements for a simple graph is correct? 

A). Every path is a trail 

B). Every trail is a path 

C). Every trail is a path as well as every path is a trail 

D). None of the mentioned

4- In the given graph identify the cut vertices.

A). B and E 

B). C and D 

C). A and E 

D). C and B

5- For the given graph (G), which of the following statements is true?

A). G is a complete graph 

B). G is not a connected graph 

C). The vertex connectivity of the graph is 2

D). The edge connectivity of the graph is 1

6- What is the number of edges present in a complete graph having n vertices? 

A). (n*(n+1))/2 

B). (n*(n-1))/2 

C). N 

D). Information given is insufficient

7- The given Graph is regular.

A). True 

B). False

8- A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

A). 15 

B). 3 

C). 1 

D). 11 

9- Which of the following properties does a simple graph not hold? 

A). Must be connected 

B). Must be un-weighted 

C). Must have no loops or multiple edges 

D). All of the mentioned

10- What is the maximum number of edges in a bipartite graph having 10 vertices? 

A). 24 

B). 21 

C). 25 

D). 16

11- For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true? 

A). v=e 

B). v = e+1 

C). v + 1 = e 

D). None of the mentioned

12- For which of the following combinations of the degrees of vertices would the connected graph be Eulerian?

A). 1, 2, 3

B). 2,3,4 

C). 2,4,5 

D). 1,3,5

13- A graph with all vertices having equal degree is known as a __________ 

A). Multi Graph 

B). Regular Graph 

C). Simple Graph 

D). Complete Graph 

14- Which of the following ways can be used to represent a graph? 

A). Adjacency List and Adjacency Matrix 

B). Incidence Matrix 

C). Adjacency List, Adjacency Matrix as well as Incidence Matrix 

D). None of the mentioned 

15- The number of elements in the adjacency matrix of a graph having 7 vertices is __________ 

A). 7 

B). 14 

C). 36 

D). 49 

16- If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y. 

A). x=5, y=3 

B). x=3, y=5 

C). x=3, y=3 

D). x=5, y=5