Data Structures and Algorithms - Graphs

6. Which of the following is useful in implementing quick sort?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


7. The maximum degree of any vertex in a simple graph with n vertices is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


8. The number of edges in a regular graph of degree d and n vertices is

  • Option : D
  • Explanation : In a regular graph, all the vertices will be of the same degree. Total degrees of all the vertices is nd. Each edge will be increasing the total degree by 2. So, totally ndl2 edges.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


9. The correct matching for the following pairs is (A) All pairs shortest path (B) Quicksort (C) Minimum weight spanning tree (D) Connected Components (1) Greedy (2) Depth-first search (3) Dynamic programming (4) Divide and conquer

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


10. Which of the following expressions accesses the (i,j)th entry of an (m x n) matrix stored in column-major form?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


  • Graphs Questions can be used to give quizzes by any candidate who is preparing for UGC NET Computer Science
  • This Graphs Questions section will help you test your analytical skills in a tricky method, thereby giving you an edge over other students
  • Any student who wants to prepare for DOEACC A Level, DOEACC B Level, and DOEACC C level can also use these Objective Type Questions Answer.
  • All candidates who have to appear for the Kendriya Vidyalaya Entrance exam can also refer to this mcq section.
  • You can also get access to the Graphs MCQ ebook.
  • Graphs Questions can be used in the preparation of JRF, CSIR, and various other exams.
  • You can also download pdf for these Graphs multiple-choice questions Answers.
  • This Graphs Multiple Choice Questions Answers section can also be used for the preparation of various competitive exams like UGC NET, GATE, PSU, IES, and many more.
  • Graphs Questions can be used to gain a credit score in various undergraduate and postgraduate courses like BSc, MSc and MCA
  • Graphs Questions for UGC NET Computer Science

    Graphs MCQ

    Graphs Multiple choice questions