Scribd
Upload
4 views

4

The document outlines the examination structure for the B.E./B.Tech. Degree in Data Structures and Applications for the June/July 2024 session. It includes details about the modules, questions, and marks distribution, emphasizing various data structure concepts such as linked lists, trees, and hashing. Students are required to answer five full questions, selecting one from each module.

Uploaded by

arlop0302
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
4 views

4

The document outlines the examination structure for the B.E./B.Tech. Degree in Data Structures and Applications for the June/July 2024 session. It includes details about the modules, questions, and marks distribution, emphasizing various data structure concepts such as linked lists, trees, and hashing. Students are required to answer five full questions, selecting one from each module.

Uploaded by

arlop0302
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

GBGS SCHEME

BCS304
USN

Third Semester B.E./B.Tech. Degree Examínation, Junc/July 2024


DataStructures and Applications
Time: 3 hrs. Max. Marks: 100
Nore: 1. Ansnwer any FVE full questions, choosing ONE full question from each module.
2. M: Marks , L: Bloom 's level,C: Cnurse outcomes.

Module -1 M C
What is data stncture? List and explain data structure operations. 08 L2 CO1
Q.1
Discuss four dynamic memory allocation functions. 08 L2 CO1
With suitable example, discuss self-referential structures. 04 L2 CO1
OR
What is sparse matrix? Give the triplet form for given matrix and also find 06 L3 C02
Q.2
its transpose.
0 3
0 10 0 40
1 22 0
A= 2 0

3200 50
4 0 15 0 25
b. Explain ADT stack. 07 L2 CO2
DefincStack. Implement the operations of stack using arrays. 07 L1 CO2
Module-2
Q.3 a. What is the advantage of circular queue over ordinary queue? Discuss the | 08 L2 C02
implementation of circular queue operations.
b. Demonstrate multiple stacks and queues with suitable examples. 12 L2 CO2
OR
Q.4 a. Explain Linked Stacks and Queues operations. 10 L2 CO2
b Givethe Cfunctions forthe following on singly linked list with example: 10 L3 CO3
i) Insert a node at the beginning
ii) Delete a node at the front
ii) Display
Module -3
0.5 Define linked list? Implement C function for the following circular Doubly 10 L3 CO3
linked list:
i) Insert a node at the beginning
ii) Dclete a node at the end
ii) Display
b. Develop a function to delete a node whose information field is specified in 10 L3 CO3
singly linked list.
OR
Q.6 a. What is a trec? With suitableexample, define 07 L2 CO4
i) Complete binary tree
ii) Degree of the tree
iii) Levcl ofa node
b. Listand explain representation of abinary tree? 07 L2 CO4
c. Explain In-threaded binary tree. 06 L2 C04

lof2
BCS304

Module 4
Q.7 a. Forthe given data, draw a binary scarch trcc. 07 L3 C04
100, 85. 45, 5$, 110, 20, 70, 65
b. List and explain the common operations ofbinary scarch trec. 07 L2 C04
c. Explain about forests. 06 L2 CO2
OR
Q.8 Define graph. Explain graph abstract data types. 10 L2 CO4
b. Explain the elementary graphoperations. 10 L2 CO4
Module -5
Q.9 3. Define hashing. Explain types of hashing functions in detail. 10 L2 CO5
b Explain static hashing and dynamic hashing in detail. 10 L2 CO5
OR
Q.10 Write a short note on
a. Leftist trees 06 L2 CO4
b. Optimal binary search tree 07 L2 CO5
C. Priority queues 07 L2 CO2

MP
M - P
0 i : 4 0 : 3 1 p m

MP

MP-MP

P -

2 of2

You might also like