CBCS SCHEME BCS304

USNAcI
Third
38
Semester B.E./B.Tech. Degree Examination,
Dec.2024/Jan.2025
Data Structures and Applications Max, Marks: 100
Time: 3 hrs.
each module.
Note: 1. Answer any FIVE fullquestions, choosing ONE fullquestion from
2. M:Marks , L: Bloom 's level, C: Course outcomes.
M L C
Module1 CO1
8 L2
Q.1 a. Define Data Structures. Explain theclassification of data structures with a
neat diagram.
7 L2 C02
b. Write aC Functions to implement pop , push and display operations for
stacks using assays.
L2 CO1
Differentiate structures and unions.
OR
Q.2 a Write an algorithm to evaluate a postfix expression and apply the same for 7 |L3 CO2
the given postfix expression.
62/3-42 *+.
b. Explain the dynamic memory allocation function in detail. 8 L2 CO1

C What is Sparse matrix? Give the triplet form of a given matrix and find its L3 C01
transpose
00 3 0 4
2 8 : 2

005 70
A=
000 00
0 2 6 0 0

Module 2
Q.3 a. Define Queue. Discuss how to represent a queue using dynamic assays. 8 L2 C02
b. Write a CFunction to implement insertion () , deletion () and display ()6 L3 C02
operations on circular queue.
C
Write anote on Multiple stacks and queues with suitable diagram. 6 L2 C02
OR
Q.4 What is a linked list? Explain the different types of linked list with neat 6 L2 C03
diagram.
b. Write a Cfunction for the following on singly linked list with example : 8 L3 C03
i) Insert anode of the beginning
ii) Delete a node at the front
ii) Display.
C. Write the C function to add two polynom ials. 6 L2 C03

lof2
 BCS304

Module-3 6 L2 C04
Q.5 Discuss how binary trees are represented using : ) Assay i ) Linked list,
6 L2 C04
b. Define Threaded binary tree, Discuss In - threaded birnary tree.
L3 C03
c. Write the C function for the following additional list operation :
Singly linked list.
i) Inverting Singly linked list i) Concatenating
OR L3 CO04
Postorder and Level order traversal ith 8
Q.6 a. Discuss Inorder , Preorder
suitable function for each.
L2 C04
6
the threaded binary tree, Construct threaded binary tree for the
D. Define
following element : A, B, C,D, E, F, G, H, I. L3 C03
6
Write a C function for the following :doubly linked list:
beginning of
1) Insert a node at the end of the doubly linked list.
ii) Deleting a node at the
Module-4 L1 CO5
traverse using 8
Forest, Transform the forest into a binary tree and
Q.7 a. Define traversal with an example.
inorder , preorder and postorder L2 C05
following 6
search tree. Construct a binary search tree for the
b. Define Binary 120,20,70, 90, 115, 65, 130, 145.
elements : 100, 85 , 45,55, L2 COS
6
example.
C. Discuss Selection tree with an
OR 8 L2 C05
representation
Graph. Explain adjacency matrix and adjacency list
Q.8 a. Define
with an example.
6 L2 C05
b. Define the following
terminology with example : graph.
ii) Self loop iv) Connected
i) Digraph ii) Weighted graph
6 L3 CO5
C. Briefly explain about Elementary graph operations,
Module -5
6 L2 C05
Q.9 aExplain in detail about Static and Dynamic Hashing.
7 L2 CO5
methods to resolve collision?
b. What is Collision? What are the
7 L2 CO5
C. Explain Priority queue with the help of an examples.
OR
12 L2 CO5
Q.10|a. Define Hashing. Explain different hashing functions with suitable
examples.
8 L3 C05
b. Write short note on
i) Leftist trees ii) Optimal binary search tree.

2of2