A. | Stacks |
B. | set |
C. | List |
D. | Queue |
Option: A Explanation : Click on Discuss to view users comments. |
A. | n |
B. | n-1 |
C. | n+1 |
D. | 2n-1 |
Option: B Explanation : Click on Discuss to view users comments. |
A. | maximum of n,d |
B. | n+d |
C. | nd |
D. | nd/2 |
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. |
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 |
Option: B Explanation : Click on Discuss to view users comments. |
Syllabus covered in this section is-
This Section covers Data Structures Questions Answers using C language .
Who can benefit -
Various Search Terms used for this section are