Classical

Data Structures - Graphs

11:  

Sparse matrices have

A.

many zero entries

B.

many non-zero entries

C.

higher dimension

D.

none of the above

 
 

Option: A

Explanation :

Click on Discuss to view users comments.

Write your comments here:



12:  

The minimum number of edges in a connected cyclic graph on n vertices is

A.

n-1

B.

n

C.

n+1

D.

none of the above

 
 

Option: B

Explanation :

Click on Discuss to view users comments.

Write your comments here:







Suggest an improvement