# Data Structures - Graphs

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

 A. Stacks B. set C. List D. Queue Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. Write your comments here:
7:
The maximum degree of any vertex in a simple graph with n vertices is

 A. n B. n-1 C. n+1 D. 2n-1 Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Write your comments here:
8:
The number of edges in a regular graph of degree d and n vertices is

 A. maximum of n,d B. n+d C. nd D. nd/2 Answer Report Discuss 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. Click on Discuss to view users comments. Write your comments here:
9:
The correct matching for the following pairs is

(A) All pairs shortest path
(B) Quick sort
(C) Minimum weight spanning tree
(D) Connected Components

(1) Greedy
(2) Depth-first search
(3) Dynamic programming
(4) Divide and conquer

 A. A-2 , B-4 , C-1 , D-3 B. A-3 , B-4 , C-1 , D-2 C. A-3 , B-4 , C-2 , D-1 D. A-4 , B-1 , C-2 , D-3 Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Write your comments here:
10:

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

 A. n x (i -1) + j B. m x (j -1) + i C. m x (n-j) + j D. n x (m-i) + j Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Write your comments here:

## Suggest an improvement

Syllabus covered in this section is-

• Abstract data types
• Algorithms
• Stacks, Queues
• Trees, Binary search trees
• Binary heaps

This Section covers Data Structures Questions Answers using C language .
Who can benefit -

• Any student who is pursuing B.Sc. in Information Technology can also use this Data Structures mcq section.
• Data Structures MCQs can also be used by any student who is pursuing any undergraduate or postgraduate degree in Computer Science.
• Any candidate who has to appear for DOEACC A, B or C level Exam can also use Data Structures Questions Answers to gain credits in their exams.
• Candidates appearing for Kendriya Vidyalya Sangathan Entrance Exam can also use Data Structures Multiple Choice Questions Answers for the preparation of their exams.
• Data Structures Questions Answers can also be used by MCA students for the preparation of their exams.
• You can also get Data Structures mcq pdf if you purchase an e-book from site.

Various Search Terms used for this section are