Graph in Data Structure

@T-Bone

This question paper focuses on the "Graph" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

This question paper focuses on the "Graph" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

Questions

1. Which of the following statements for a simple graph is correct?

Mark the correct option

2. What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

Mark the correct option

3. Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?

Mark the correct option

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

Mark the correct option

5. n which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?

Mark the correct option

6. The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? I. 7, 6, 5, 4, 4, 3, 2, 1 II. 6, 6, 6, 6, 3, 3, 2, 2 III. 7, 6, 6, 4, 4, 3, 2, 2 IV. 8, 7, 7, 6, 4, 2, 1, 1

Mark the correct option

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

Mark the correct option

8. Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

Mark the correct option

9. he most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity. (A) \theta(n) (B) \theta(m) (C) \theta(m + n) (D) \theta(mn)

Mark the correct option

10. What is time complexity to check if a string(length S1) is a substring of another string(length S2) stored in a Directed Acyclic Word Graph, given S2 is greater than S1?

Mark the correct option

11. What is the number of edges present in a complete graph having n vertices?

Mark the correct option

12. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.

Mark the correct option

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

Mark the correct option

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

Mark the correct option

15. Which of the following is true?

Mark the correct option

16. 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?

Mark the correct option

17. for which of the following combinations of the degrees of vertices would the connected graph be eulerian?

Mark the correct option

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

Mark the correct option

19. Which of the following ways can be used to represent a graph?

Mark the correct option

20. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________

Mark the correct option

Index of Questions