Scribd
Upload
15 views2 pages

IAT 1 DS - 1question

This document outlines the internal assessment test for the B.E/B.Tech degree in Computer Science and Engineering at RVS College of Engineering and Technology, scheduled for October 31, 2023. It includes questions on data structures, covering topics such as ADTs, Euler circuits, bi-connectivity, cyclic graphs, and various graph algorithms like breadth-first search, depth-first search, Dijkstra's, Kruskal's, and Prim's algorithms. The assessment is divided into three parts with specified marks for each question.

Uploaded by

Surya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views2 pages

IAT 1 DS - 1question

This document outlines the internal assessment test for the B.E/B.Tech degree in Computer Science and Engineering at RVS College of Engineering and Technology, scheduled for October 31, 2023. It includes questions on data structures, covering topics such as ADTs, Euler circuits, bi-connectivity, cyclic graphs, and various graph algorithms like breadth-first search, depth-first search, Dijkstra's, Kruskal's, and Prim's algorithms. The assessment is divided into three parts with specified marks for each question.

Uploaded by

Surya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

RVS COLLEGE OF ENGINEERING AND TECHNOLOGY, COIM-

BATORE – 641 402

Reg. No

B.E/ B.Tech - DEGREE EXAMINATION, OCTOBER - 2023


Third Semester
Department of Computer Science and Engineering
CS 3301 – Data structures
Internal Assessment Test –I
Time: 02.45 pm to04 .15 pm Date: 31/10/23 (AN) Max Marks: 50
PART A (5x2=10 Marks)
Bloom’ s
Q. No. Questions CO
Level
1. Explain the term ADT with operation CO4 K2
Define Euler circuits CO4
2. K2

3. What is Bi-connectivity CO4 K2

4. What is cyclic graph CO4 K1

5. Outline a directed graph with an example CO4 K2


PART B (2x13 = 26 Marks)
Bloom’s
Q. No. Questions CO
Level
6.(A) Explain the breadth first search traversal with an example CO4 K2
(OR)
Outline the steps in the dijkstra’s shortest path algorithm with an
graph
V1
2 V2

4 1 3 10
6. (B) V3
2 V4
7
CO4 K3
V5

5 8 4
V6 1 V7 6

7.(A) Explain the depth first search graph algorithm with example CO4 K2
(OR)
RVS COLLEGE OF ENGINEERING AND TECHNOLOGY, COIM-
BATORE – 641 402

Explain the kruskal’s algorithm with an graph


2
4 2
7.(B) 3 10 CO4 K3
2 7
5 8 4
1 6

PART C (1x14 = 14 Marks)


Explain the prim’s algorithm with an graph

V1
2 V2

8.(A) 4 2 1 3 10 CO4 K3
V3 V4
7 V5

5 8 4
V6 1 V7 6

Subject Handling Faculty IQAC HoD/CSE

You might also like