[go: up one dir, main page]
Scribd
Upload
45 views2 pages

DSA-Unit Test II Paper

The document outlines the Unit Test II for the Department of Computer Engineering at STES' Sinhgad College of Engineering for the academic year 2024-25. It includes questions on data structures and algorithms, covering topics such as graph traversal, minimum spanning trees, height-balanced binary search trees, and tree structures. Students must choose between two sets of questions and demonstrate their understanding through algorithms, definitions, and examples.

Uploaded by

07- Pranjal Chinchwale
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
45 views2 pages

DSA-Unit Test II Paper

The document outlines the Unit Test II for the Department of Computer Engineering at STES' Sinhgad College of Engineering for the academic year 2024-25. It includes questions on data structures and algorithms, covering topics such as graph traversal, minimum spanning trees, height-balanced binary search trees, and tree structures. Students must choose between two sets of questions and demonstrate their understanding through algorithms, definitions, and examples.

Uploaded by

07- Pranjal Chinchwale
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

STES’ SINHGAD COLLEGE OF ENGINEERING

DEPARTMENT OF COMPUTER ENGINEERING


UNIT TEST –II (AY: -2024-25)
--------------------------------------------------------------------------------------------------------------------------
MIN MARKS: 12 SUB: DSA MAX MARKS:30
Time: -1 Hr. Sem:-II
Class: -SE Date: - 15/4/2025
--------------------------------------------------------------------------------------------------------------------------
NOTE: - (Solve Q1 or Q2, Q3 or Q4 Q5 or Q6)
Marks BL CO PO PI

Q.1 a. Write an algorithm for breadth first traversal. 5 B3 – CO1 PO1 1.1.2
Apply
b. Generate minimum spanning tree using Prim’s 5 B3 – CO2 PO2 2.1.3
Algorithm and find the cost of minimum spanning tree Apply

(MST) of the given graph starting from vertex ‘5’

c. Define following terms 5 B1 – CO1 PO1 1.1.1


Remem
i. Complete Graph ber
ii. Strongly connected graph
iii. In-degree and out-degree
iv. DAG
v. MST

OR
Q2. a. Write an algorithm for depth first traversal of a graph. 5 B3 – CO1 PO1 1.1.2
Apply
b. Generate minimum spanning tree using Kruskal’s 5 B3 – CO2 PO2 2.1.3
Algorithm and find the cost of minimum spanning tree Apply
c. Explain different types of Graph storage structure and 5 B2 – CO1 PO2 1.2.1
give example of each Unders
tand
Q.3 a. Construct the Height Balanced BST for the following data 5 B3 – CO3 PO1 1.1.2
by inserting each of the following data item one at a time: Apply
(show all steps and rotations using diagrams)

10, 20, 15, 12, 25, 30, 14, 22, 35, 40

b. Write functions for RR and RL rotation with respect to 5 B3 – CO3 PO2 2.1.3
AVL tree. Apply

c. Define Red Black tree. List its properties. Give example 5 B1 – CO3 PO1 1.1.1
of it. Remem
ber
OR
Q.4 a. What is OBST? List binary search tree with 3 words (w1, 5 B4 – CO4 PO2 2.3.1
w2, w3) = (do, if, stop) words occurs with probabilities Analyze
(p1, p2, p3) = (0.4,0.5,0.1) find expected access time in
each case.
b. Explain with example K dimensional tree. 5 B2 – CO4 PO1 1.2.1
Unders
tand
c. Explain static and dynamic tree tables with suitable 5 B2 – CO4 PO2 2.1.1
example. Unders
tand
Best of luck

You might also like