Programming and Data Structures - Graphs

1. 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 *


2. Sparse matrices have

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 *


3. The minimum number of edges in a connected cyclic graph on 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 *


4. The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges 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 *


5. Which of the following is useful in traversing a given graph by breadth-first search?

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 *