Scribd
Upload
28 views1 page

JNTUH B.Tech Data Structures Exam 2022

This document is an exam for a data structures course that contains 8 questions. The questions cover a range of data structure topics including: - Defining and drawing a single linked list structure - Explaining queue operations and applications - Implementing stack operations - Explaining skip list and linear probing/open addressing differences - Discussing hash functions and advantages of extendible hashing - Constructing and modifying a red-black tree - Explaining splaying operations of a splay tree with an example - Writing an algorithm for depth-first search and performing heap sort - Defining the differences between trees and tries, and illustrating a brute force algorithm

Uploaded by

ARUN Linux
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
28 views1 page

JNTUH B.Tech Data Structures Exam 2022

This document is an exam for a data structures course that contains 8 questions. The questions cover a range of data structure topics including: - Defining and drawing a single linked list structure - Explaining queue operations and applications - Implementing stack operations - Explaining skip list and linear probing/open addressing differences - Discussing hash functions and advantages of extendible hashing - Constructing and modifying a red-black tree - Explaining splaying operations of a splay tree with an example - Writing an algorithm for depth-first search and performing heap sort - Defining the differences between trees and tries, and illustrating a brute force algorithm

Uploaded by

ARUN Linux
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

Code No:153AK R18

JN
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
[Link] II Year I Semester Examinations, March - 2022
DATA STRUCTURES
(Common to CSE, IT, ECM, CSBS, CSIT, ITE, CSE(SE), CSE(CS), CSE(AIML), CSE(DS),
TU
CSE(IOT), CSEN)
Time: 3 Hours Max. Marks: 75
Answer any five questions
All questions carry equal marks
H
---

1.a) Define a single linked list. Write the structure of the linked list with a neat sketch.
U
b) Explain the operations of queue. [8+7]

2.a) Write a program to implement stack operations.


se
b) What are the applications of the queue? Explain. [8+7]

3.a) Explain the operations of the skip list representation.


dp
b) Is linear probing and open addressing same? Justify your answer. [10+5]

4.a) Discuss the hash functions.


ap
b) List and explain the advantages of extendible hashing. [10+5]

5.a) Construct a Red-Black tree with the following elements 40, 16, 36, 54, 18, 7, 48, 5. Delete
element 18 and add element 66.
er
b) Write an algorithm of single rotation and double rotation of an AVL tree. [9+6]
s
6.a) Explain the splaying operations of splay tree with an example.
b) Define Binary search tree. [12+3]
M
7.a) Write an algorithm to implement a depth-first search with an example.
b) Perform heap sort algorithm for (10 15 6 2 25 18 16 2 20 4). [12+3]
ar
8.a) Difference between tree and tries.
b) Illustrate the Brute force algorithm. [5+10]
c
---oo0oo---
h
20
22

You might also like