Adjacency List MCQ

Test your knowledge with important Adjacency List MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Adjacency List MCQs at Bissoy

• What would be the time complexity of the BFS traversal of a graph with n vertices and n1.25 edges?
  ক

  O(n)

  খ

  O(n1.25)

  গ

  O(n2.25)

  ঘ

  O(n*n)
• To create an adjacency list C++’s map container can be used.
  ক

  True

  খ

  False
• In which case adjacency list is preferred in front of an adjacency matrix?
  ক

  Dense graph

  খ

  Sparse graph

  গ

  Adjacency list is always preferred

  ঘ

  Complete graph
• Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________
  ক

  O(V)

  খ

  O(E*E)

  গ

  O(E)

  ঘ

  O(E+V)
• For the given conditions, which of the following is in the correct order of increasing space requirement? i) Undirected, no weight ii) Directed, no weight iii) Directed, weighted iv) Undirected, weighted
  ক

  ii iii i iv

  খ

  i iii ii iv

  গ

  iv iii i ii

  ঘ

  i ii iii iv
• Time complexity to find if there is an edge between 2 particular vertices is _________
  ক

  O(V)

  খ

  O(E)

  গ

  O(1)

  ঘ

  O(V+E)
• For some sparse graph an adjacency list is more space efficient against an adjacency matrix.
  ক

  True

  খ

  False
• Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________
  ক

  O(E)

  খ

  O(V*V)

  গ

  O(E+V)

  ঘ

  O(V)