Page 1 of 2
USN 21CST302
B. E. Degree (Autonomous) Third Semester End Examination (SEE), Feb 2022 / March 2022 DATA STRUCTURES AND APPLICATIONS
[ Time: 3 Hours ] [ Maximum Marks: 100 ]
Instructions to students:
1. Answer FIVE FULL questions.
2. Answer ANY ONE from Question No.1 and 2 3. Answer ANY ONE from Question No.3 and 4 4. Answer ANY ONE from Question No.5 and 6 5. Answer ANY ONE from Question No.7 and 8 6. Answer ANY ONE from Question No.9 and 10
Marks CO BTL
1 A) Define Data Structures, Why do we need Data Structures and Explain how Data Structures can be classified.
6
Marks CO1 L1 B) Differentiate between Arrays and Dynamically allocated arrays with an
example. 6
Marks CO1 L3 C) What is an Algorithm? Write a C program to perform the below
operations on an unordered list of integers a. Selection Sort.
b. Linear Search.
8
Marks CO1 L3
OR
2 a) With an example explain polynomial representation using arrays; Write a function to add two polynomials.
10
Marks CO1 L3 b) What is Sparse Matrix, justify how it is an abstract data type, Write a
function for transpose of a Sparse Matrix. 10
Marks CO1 L3 3 a) Define Recursion, Write a C program for Solving the Towers of Hanoi
problem, and trace it for 3 disks. 10
Marks CO2 L5 b) Write a C program to convert infix to postfix expression using Stack,
and write the postfix expression for expression (a+b)*c+(d-a).
10
Marks CO2 L2
OR
4 a) With example explain Stack using Arrays and Stack using Dynamic
arrays. 10
Marks CO2 L2 b) With a suitable example explain how you evaluate postfix expression
using stack. 10
Marks CO2 L3 5 a) Define Queues and explain various operations which can be performed
on Queues with an example.
8
Marks CO3 L3 b) Write a C program to simulate the working of a circular queue of
integers using an array. Provide the following operations:
a. Insert b. Delete c. Display
8
Marks CO3 L5 c) With an example explain Queues using Dynamic Arrays 4
Marks
OR
6 a) What is Linked List, Write down the steps to modify a node in linked lists with an example. What is the basic purpose of header of the linked list?
6
Marks CO3 L3 b) Consider the following relation schema
Project(P_No, P_Name, P_Incharge)
10 Marks
CO3 L5
Dr. Ambedkar Institute of Technology, Bangalore – 560056
(An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
Page 2 of 2 Employee(E_No, E_Name)
Assigned_to(P_No, E_No)
Write the SQL Queries for the following:
(i) List details of employees who are working on all the projects.
(ii) List E_No of employees who are not working on project number 2K.
(iii) List the names of employees who are working in the same project as employee named ‘Tom’.
(iv) List the names of employees who are not working in any project
7 a) Define multi valued dependency. Explain 4NF with example. 10
Marks CO3 L3 b) Explain 1NF, 2NF and 3NF with suitable examples for each. 10
Marks CO3 L3
OR
8 a) Explain informal design guidelines used as a measure to determine the
quality of relation schema design 10
Marks CO4 L3 b) Define join dependency. Explain 5NF with example. 10
Marks CO4 L3 9 a) Discuss time stamp ordering protocol for concurrency control. 04
Marks CO5 L2 b) Explain Multiple-granularity locking with example and also explain
under what circumstances is it used.
08
Marks CO5 L4 c) Explain the 2PL with examples and along with its advantages. 08
Marks CO5 L3
OR
10 a) Prove that Strict Two-Phase locking protocol guarantees Strict Schedule with example.
08
Marks CO5 L4 b) Explain how to resolve deadlock and starvation problems. 04
Marks CO5 L3 c) Explain time stamp ordering algorithm with example. 08
Marks CO5 L3
******
Dr. Ambedkar Institute of Technology, Bangalore – 560056
(An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
