Data Structure
CIS · Quiz · Summer 26
Paper 1 of 4Section A · Batch 24 · Md Shahinur Rahman (স জি ব) (1)Switch
Section A · Batch 24
Paper 1 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: 13/08/2026
Time: 30 Minutes
Total Marks: 15
1. If Depth-First Search (DFS) starts from vertex A in the following graph, what will be the sequence of vertices visited? Assume that when multiple adjacent vertices are available, they are selected in alphabetical order. [6]
[Figure: A graph with vertices A, B, C, D, E, F and edges connecting them]
2. Find the minimum travel distance from A to E in the following diagram. Also, identify the corresponding shortest path. [9]
[Figure: A directed graph with weighted edges connecting vertices A, B, C, D, E]