CS8391 DATA STRUCTURES

CS8391 Data Structures

1. 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) Path and trail have no relation

Answer: a

2. In the given graph identify the cut vertices.

a) B and E

b) C and D

c) A and E

Answer: d

3. 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

Answer: c

4. 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

Answer: b

5. The given Graph is regular.

a) True

b) False

Answer: a

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

a) 15

b) 3

c) 1

d) 11

Answer: b

7. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph
G'(Complement of G) is ___________

a) (n*n-n-2*m)/2

b) (n*n+n+2*m)/2

c) (n*n-n-2*m)/2

d) (n*n-n+2*m)/2

Answer: a

8. Which of the following properties does a simple graph not hold?

a) Must be connected

b) Must be unweighted

c) Must have no loops or multiple edges

d) Must have no multiple edges

Answer: a

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

a) 24

2 www.studymaterialz.in
 CS8391 DATA STRUCTURES

b) 21

c) 25

d) 16

Answer: c

10. Which of the following is true?

a) A graph may contain no edges and many vertices

b) A graph may contain many edges and no vertices

c) A graph may contain no edges and no vertices

d) A graph may contain no vertices and many edges

Answer: b

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) v = e-1

Answer: b

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

Answer: a

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

a) Multi Graph

b) Regular Graph

c) Simple Graph
3 www.studymaterialz.in
 CS8391 DATA STRUCTURES

d) Complete Graph

Answer: b

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) No way to represent

Answer: c

15. The number of possible undirected graphs which may have self loops but no multiple edges and
have n vertices is ________

a) 2((n*(n-1))/2)

b) 2((n*(n+1))/2)

c) 2((n-1)*(n-1))/2)

d) 2((n*n)/2)

Answer: d

16. Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions.
What will be the number of connected components?

a) 1

b) 2

c) 3

d) 4

Answer: b

17. Number of vertices with odd degrees in a graph having a eulerian walk is ________

a) 0

b) Can’t be predicted

c) 2

d) either 0 or 2

Answer: d
4 www.studymaterialz.in
 CS8391 DATA STRUCTURES

18. How many of the following statements are correct?

i) All cyclic graphs are complete graphs.

ii) All complete graphs are cyclic graphs.

iii) All paths are bipartite.

iv) All cyclic graphs are bipartite.

Answer: b

19. What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.

a) n-2

b) n

c) 2

d) 0

Answer: a

20. Which of the following graphs are isomorphic to each other?

a) fig 1 and fig 2

b) fig 2 and fig 3

c) fig 1 and fig 3

Answer: d

21. In the given graph which edge should be removed to make it a Bipartite Graph?

a) A-C

b) B-E

c) C-D

Answer: a

22. What would the time complexity to check if an undirected graph with V vertices and E edges is
Bipartite or not given its adjacency matrix?

a) O(E*E)

b) O(V*V)

5 www.studymaterialz.in
 CS8391 DATA STRUCTURES

c) O(E)

d) O(V)

Answer: b

23. Which of the following is not a topological sorting of the given graph?

a) A B C D E F

b) A B F E D C

c) A B E C F D

Answer: d

24. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

a) (V*(V-1))/2

b) (V*(V+1))/2

c) (V+1)C2

d) (V-1)C2

Answer: a

25. The topological sorting of any DAG can be done in ________ time.

a) cubic

b) quadratic

c) linear

d) logarithmic

Answer: c

26. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.

a) Many Hamiltonian paths are possible

b) No Hamiltonian path is possible

c) Exactly 1 Hamiltonian path is possible

d) Given information is insufficient to comment anything

Answer: b

6 www.studymaterialz.in
 CS8391 DATA STRUCTURES

27. What sequence would the BFS traversal of the given graph yield?

a) A F D B C E

b) C B A F E D

c) A B D C E F

Answer: c

28. a) 0 2 3 1 4

b) 0 3 2 4 1

c) 0 2 3 4 1

d) 0 3 2 1 4

Answer: b

29. Which of the given statement is true?

a) All the Cyclic Directed Graphs have topological sortings

b) All the Acyclic Directed Graphs have topological sortings

c) All Directed Graphs have topological sortings

d) All the cyclic directed graphs hace non topological sortings

Answer: d

30. What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed
Acyclic Graph?

a) Depends on a Graph

b) Will always be zero

c) Will always be greater than zero

d) May be zero or greater than zero

Answer: b

7 www.studymaterialz.in