Data Structure
CIS · Quiz · Summer 26
Paper 4 of 4Section A · Batch 24 · Md Shahinur Rahman (স জি ব) (3)Switch
Section A · Batch 24
Paper 4 of 4
Read the questions as text
Read off the PDF by AI, so it may have mistakes. The PDF is the original.
Class Test (3) Examination: Summer-2026
Course Code: CIS 122 (Batch: 24)
Course Title: Data Structure
Date: 09/08/2026
Time: 30 Minutes
Total Marks: 15
1. If Depth-First Search (DFS) starts from vertex 4 in the following graph, what will be the sequence of vertices visited? Assume that when multiple adjacent vertices are available, they are selected in ascending numerical order.
[Figure: A graph with vertices 0, 1, 2, 3, 4, 5, 6 and connecting edges]
2. Find the minimum travel distance from Sagordari to Kuthibari in the following diagram. Also, identify the corresponding shortest path.
[Figure: A weighted graph with vertices representing locations like Mahasthangar, Sagordari, Saint-Martin, DIU, Kuthibari, Taj Mahal, and Ahsan Manzil with various edge weights]