Scribd
Upload
39 views2 pages

AprilMay 2023

This document is a question paper for a Data Structures exam containing 11 questions split into 2 parts. Part A contains 10 short answer questions testing concepts like stack, queue, skip list, hash tables, binary trees, heaps, graphs, tries, and pattern matching. Part B contains 5 long answer questions asking students to write algorithms or explain concepts in more depth, including stack and queue implementations, skip lists, hashing, binary search trees, AVL trees, graph search algorithms, sorting, pattern matching, and compressed tries.

Uploaded by

nagarjun
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
39 views2 pages

AprilMay 2023

This document is a question paper for a Data Structures exam containing 11 questions split into 2 parts. Part A contains 10 short answer questions testing concepts like stack, queue, skip list, hash tables, binary trees, heaps, graphs, tries, and pattern matching. Part B contains 5 long answer questions asking students to write algorithms or explain concepts in more depth, including stack and queue implementations, skip lists, hashing, binary search trees, AVL trees, graph search algorithms, sorting, pattern matching, and compressed tries.

Uploaded by

nagarjun
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 No: 153AK R18

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


B. Tech II Year I Semester Examinations, April/May - 2023
DATA STRUCTURES
JN
(Common to CSE, IT, ECM, CSBS, CSIT, ITE, CE(SE), CSE(CS), CSE(DS), CSE(IOT),
CSE(N), AI&DS, AI&ML, CSD)
Time: 3 Hours Max. Marks: 75
TU
Note: i) Question paper consists of Part A, Part B.
ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions.
iii) In Part B, Answer any one question from each unit. Each question carries 10 marks
and may have a, b as sub questions.
H
PART – A
(25 Marks)
U
1.a) Give examples for stack. [2]
se
b) How to construct a queue using stacks? [3]
c) What is a skip list? [2]
d) List the drawbacks of open addressing. [3]
e) What does the color notate in red-black tree? [2]
d
f) What operations are performed on Splay trees? [3]
g) What is a max heap? [2]
pa
h) Give example for adjacency list of a graph. [3]
i) Define trie. [2]
j) What are the merits and demerits of brute force method for pattern matching? [3]
pe
PART – B
(50 Marks)
rs
2. Write and explain algorithms for Push and pop operations of stack using linked list.[10]
OR
3.a) Describe the conditions of overflow and underflow in a queue.
20
b) Discuss the applications of queues. [5+5]

4.a) Demonstrate skip list representation of a dictionary.


b) How to perform reassign operation on a dictionary. [5+5]
23
OR
5. Explain the algorithm for implementing quadratic probing on a hash table. [10]

6.a) Illustrate search operation on binary search tree.


b) Discuss the importance of height balanced trees for searching. [5+5]
OR
7.a) With suitable examples, illustrate right-left rotation on AVL tree.
b) Differentiate between splay tree and red-black tree. [5+5]
8. Make a comparison of breadth first search and depth first search for a graph. [10]
OR
JN
9. Write an algorithm for merge sort and explain with a suitable example. [10]

10. Describe the Knuth-Morris-Pratt algorithm for pattern matching. [10]


OR
TU
11. “A compressed trie is an advanced version of the standard trie.” Support or oppose this
statement with necessary explanation. [10]
H
---ooOoo---
U
se
d
pa
pe
rs
20
23

You might also like