Follow Us :

Programming and Data Structures - Graphs

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Computer Science And Information Technology > > Programming and Data Structures > > 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 *


Related Quiz.
Graphs