Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
21 views2 pages

Data Structures

The document outlines the structure of the B.Tech I Year II Semester Regular Examinations for Data Structures, scheduled for July 2024, with a total of 70 marks. It consists of a compulsory Part-A with 10 short answer questions and Part-B containing five units, each requiring detailed answers on various data structure topics including queues, linked lists, sorting algorithms, binary trees, and graph traversals. The exam emphasizes practical implementation and theoretical understanding through programming tasks and algorithm explanations.

Uploaded by

sbalajibalaji512
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
21 views2 pages

Data Structures

The document outlines the structure of the B.Tech I Year II Semester Regular Examinations for Data Structures, scheduled for July 2024, with a total of 70 marks. It consists of a compulsory Part-A with 10 short answer questions and Part-B containing five units, each requiring detailed answers on various data structure topics including queues, linked lists, sorting algorithms, binary trees, and graph traversals. The exam emphasizes practical implementation and theoretical understanding through programming tasks and algorithm explanations.

Uploaded by

sbalajibalaji512
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

Code: CS23APC201 R 23

B.Tech I Year II Semester Regular Examinations July 2024


DATA STRUCTURES
(Common to CSE, IT, CSE(AI&ML), CSE(CS) and CSE(DS))
Time: 3 hrs. Max Marks: 70
PART-A
(Compulsory Question)
1. Answer the following 10 x 02 = 20 Marks

a) Define Abstract Data Type. 2M


b) List out the applications of stack. 2M
c) Define Linked List. 2M
d) Explain operations on Linked list. 2M
e) What is the worst case and best case running time of Quick sort? 2M
f) What is Hash Table? 2M
g) Differentiate Binary trees and Binary Search trees. 2M
h) Define the Height, Depth, level of a Binary tree. 2M
i) Define Adjacency Matrix Representation. 2M
j) What is Graph? 2M

PART-B
Answer All five Units 05 x 10 = 50 Marks

UNIT-I
2. Define Queue and its operations implementation using arrays with a example 10 M
program using C?
OR
3. Convert the infix expression a / b – c + d * e – a * c into postfix expression and 10 M
trace that postfix expression for given data a = 6, b = 3, c = 1, d = 2, e =4.
UNIT-II
4. Explain about Singly linked list and its operations implementation with a C 10 M
program.
OR
5. Define Stack and its operations implementation using pointers with a example 10 M
program using C.
UNIT-III
6. a) Illustrate with examples how memory issues can be resolved by collision handling 5M
schemes.
b) Explain about sorting and its types and sort the given elements using Insertion 5M
sort 77,33,44,11,88,22,66,55.
OR
7. a) Illustrate Quick Sort with implementation Program. 6M
b) Explain about sorting and its types and sort the given elements using Quick sort 4M
77,33,44,11,88,22,66,55.

Page 1 of 2
Code: CS23APC201 R 23
UNIT-IV
8. What is Binary Tree? Implement various operations on Binary Tree with neat 10 M
example.
OR
9. a) Construct AVL Tree for the following elements and also explain the rotations of 5M
the AVL tree.
8,18,5,15,17,25,40,80
b) Construct a Max-Heap tree from the following elements: 5M
15,17,6,19,11,10,13,20,8,4,12
UNIT-V
10. Describe Graph Traversals and Perform BFS for the following graph: 10 M

OR
11. a) Explain about the Kruskal’s algorithm with a neat example. 5M
b) Explain about the Adjacency Matrix and design an adjacency matrix from the 5M
following graph.

*****

Page 2 of 2

You might also like