0% found this document useful (0 votes)
16 views2 pages

B.Tech Data Structures Exam Question Paper

This document is a question paper for the I/IV B.Tech Degree Examination in Data Structures at Siddhartha Academy of Higher Education. It includes a compulsory Part A with short answer questions and a Part B with detailed questions from two units. The paper assesses various cognitive levels related to data structures, algorithms, and their applications in programming.
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
0% found this document useful (0 votes)
16 views2 pages

B.Tech Data Structures Exam Question Paper

This document is a question paper for the I/IV B.Tech Degree Examination in Data Structures at Siddhartha Academy of Higher Education. It includes a compulsory Part A with short answer questions and a Part B with detailed questions from two units. The paper assesses various cognitive levels related to data structures, algorithms, and their applications in programming.
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

SIDDHARTHA ACADEMY OF HIGHER EDUCATION

SU24 (DEEMED TO BE UNIVERSITY)


V R S School of Engineering
I/IV [Link] DEGREE EXAMINATION (Month/Year)
Second Semester
Name of the Department: CSE
Subject Code: 24IT102 Subject Title: Data Structures
Time:3Hrs QUESTION PAPER Max Marks:100
Part – A is Compulsory
Answer one (01) question from each unit of Part – B
Answers to any single question or its part shall be written at one place only
Cognitive Levels(K): K1-Remember; K2-Understand; K3-Apply; K4-Analyze; K5-
Evaluate; K6-Create
Q. No Question Marks Course Cog.
Outcome Level
Part - A 10X2=20M
1 a Write a simple program to find the sum of all elements in an array. 2 CO1 K2

Explain the algorithm step-by-step.


b Define the system life cycle. Explain its stages with respect to software 2 CO1 K2

development.
c Explain the concept of a "Queue ADT" and how it is represented in 2 CO2 K3

memory. Provide a simple example.


d What is the difference between a stack and a queue in terms of data 2 CO2 K4

access and usage?


e Describe the concept of circularly linked lists. How does it benefit 2 CO3 K3

operations compared to a singly linked list?


f Explain the use of linked lists in the implementation of stacks and 2 CO3 K3

queues.
g What is a Binary Search Tree (BST)? Explain its properties. 2 CO4 K2

h Define the following graph terminologies: 2 CO4 K2

 Vertex
 Edge
 Degree of a Vertex
I What is hashing, and how does it help in searching? 2 CO5 K3

j Analyze the advantages of quick sort over merge sort. 2 CO5 K3

Part - B 5X16 =80M


UNIT - I
2 a Explain the classification of data structures with examples. 8 CO1 K2

b Describe the importance of space and time complexity in algorithm 8 CO3 K2

design.
(OR)
3 K2
a Explain the concept of algorithm specification and data abstraction. 8 CO1
Discuss how these concepts contribute to the design and analysis of
efficient algorithms. Provide an example for each.
b A health care system needs to track the daily blood pressure readings 8 CO1 K2

of patients for a month. Write a program using a suitable data structure


to:
 Store the daily blood pressure readings (systolic and diastolic)
of patients in an array.
 Calculate the average systolic and diastolic pressure for the
month.
 Identify the day with the highest and lowest systolic and
diastolic pressure.
 Determine how many days had a systolic pressure above a
certain threshold (e.g., 140) and how many had a diastolic
pressure above another threshold (e.g., 90).

UNIT - II
4 K2/
a Write an algorithm to implement a stack using an array. Explain the 8 CO2
k3
operations that can be performed on the stack, such as push, pop,
peek, and isEmpty, and demonstrate their functionality with an
example.
b Write a program to convert an infix expression to postfix using a stack. 8 CO2 K2/
k3
(OR)
Course Coordinator Program Coordinator HOD

You might also like