| Sl. No. | Problems | Roll Numbers |
| 1 | Find out the components of a graph | 19, 48, 42, 15, 8, 23, 17, 44, 32 |
| 2 | Spanning tree in a unweighted graph | 36, 31, 11, 1, 29, 45, 9, 43, 46 |
| 3 | Prim's algorithm for shortest spanning tree | 7, 52, 51, 40, 13, 35, 34, 2, 38 |
| 4 | Shortest path between a pair of vertices | 4, 5, 6, 20, 26, 21, 12, 37, 22 |
| 5 | Breadth-first search of a Graph | 33, 49, 28, 10, 50, 18, 14, CSB07004 |
| 6 | Depth-first search of a Graph | 25, 3, 30, 39, 24, 41, 47, 27, 16 |