Scribd
Upload
9 views2 pages

Dsa Set B

Uploaded by

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

Dsa Set B

Uploaded by

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

Sinhgad Technical Education Society’s

SINHGAD ACADEMY OF ENGINEERING, KONDHWA (BK),PUNE


DEPARTMENT OF COMPUTER ENGINEERING
A.Y.2024-2025 - Semester –II Mock Endsem Exam, S.E. (Comp)
Subject: Data Structures and Algorithms[210252]

Maximum Marks: 70 Passing Marks-28 Date: /0 /2025 Time: 2 Hr 30Mins SET B


Instructions :
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6 and Q.7 or Q.8
2) Figures to the right indicate full marks

Q.No Questions Mark CO CL KL


Elaborate following terminologies with examples:
i) Adjacency List
Q1) a) [06] CO3 U F,C
ii) Adjacency Matrix

U,
Q1) b) Write pseudo code for Floyd-Warshall algorithm. [05] CO3 C,P
Ap

U,
Q1) c) [06] CO3 C,P
AP

Construct the minimum spanning tree (MST) for the given graph using
Kruskal’s Algorithm.

OR

Consider the graph represented by the following adjacency matrix :


Find minimum spanning tree of this graph using prim’s Algorithm.

U,
Q2) a) [06] CO3 C,P
Ap

Q2) b) Write a short note on topological sorting. [05] CO3 U F,C

Q2) c) Explain storage representation of graph [06] CO3 U F,C

Write algorithm to delete node from AVL tree. U,


Q3) a) [05] CO4 C,P
AP
Construct an AVL Tree for following data : U,
Q3) b) [06] CO4 C,P
50, 25, 10, 5,7,3,30,20,8,15. AP
Construct OBST for given data using dynamic programming approach. Explain
stepwise.
U,
Q3) c) [07] CO4 C,P
AP

OR
Q4) a) Differentiate between static and dynamic tree tables. [05] CO4 U F,C
Write short note on:
Q4) b) i) AA tree [06] CO4 U F,C
ii) K - dimensional tree
U,
Q4) c) Explain AVL tree rotations with example. [07] CO4 C,P
AP
Insert the keys to a 5-way B-tree: 3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 08, 19, U,
Q5) a) [07] CO5 C,P
04, 31, 35, 56. AP
U,
Q5) b) Create min heap of given data 10,20,15,12,25,30,14,2,5,4. [05] CO5 C,P
AP

Q5) c) Explain following primary index, Secondary index with example. [05] CO5 U F,C

OR
U,
Q6) a) Build B+ tree of order 3 for the following : 1,42,38,21,31,10,17,7,31,25,20,18. [07] CO5 C,P
AP
Q6) b) Explain with example trie.tree. Give advantage and applications of trie tree. [05] CO5 U F,C

Q6) c) Differentiate between B-tree and B+ trees. [05] CO5 U F,C


Explain any 3 operations carried out on sequentail file and its pseudo U,
Q7) a) [07] CO6 C,P
code. AP
U,
Q7) b) Write and explain multi way merging-a K way merge algorithm with example. [06] CO6 C,P
AP
Q7) c) Explain inverted file & cellular partitions. [05] CO6 U F,C
OR
Q8) a) Explain file Organization. Enlist various types of file Organization. [07] CO6 U F,C
Q8) b) List & explain two possible ways of representing records. [06] CO6 U F,C
Q8) c) Explain indexed sequential file organization. [05] CO6 U F,C

[Subject Teacher] [Domain Head] [HOD Comp.Engg.Dept]

……………………………BESTLUCK…………………………………

You might also like