A.  Stacks 
B.  set 
C.  List 
D.  Queue 
Option: A Explanation : 
A.  n 
B.  n1 
C.  n+1 
D.  2n1 
Option: B Explanation : 
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.

A.  A2 , B4 , C1 , D3 
B.  A3 , B4 , C1 , D2 
C.  A3 , B4 , C2 , D1 
D.  A4 , B1 , C2 , D3 
Option: B Explanation : 
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