Page |1
ACE
Engineering College
(An Autonomous Institution)
ACER22
Question Paper Code: 22CS302PC
II B. Tech- I Semester Supplementary Examinations- AUGUST-2024
DATA STRUCTURES
(Common to CSE,IT,CSM,CSD & CSO)
Time: 3 Hours Max. Marks: 60
H. T. No
Note: This question paper contains two parts A and B.
Part A is compulsory which carries 10 marks. Answer all questions in Part A.
Part B consists of 5 Units. Answer any one full question from each unit. Each question carries
10 marks and may have a, b, c as sub questions
PART- A MARKS: 10*1=10
Q.No: 1 Question Marks
a) What is the difference between a stack and a queue? 1
b) Define what a binary tree is. 1
c) Explain the concept of a hash function. 1
d) Define the term "graph" in the context of data structures. 1
e) What is the difference between a linear data structure and a non-linear data 1
structure?
f) Define the term "linked list." 1
g) Explain the term "balanced tree." 1
h) What is a max heap? 1
i) Define the term "trie" (prefix tree). 1
j) What are the merits and demerits of brute force method for pattern matching? 1
Page |2
PART- B MARKS: 5*10=50
Q.No Question Description Marks
2. (a)Discuss the applications of queues. 5+5
(b) Implement queue using arrays
(OR)
3 Write and explain algorithms for Push and pop operations of stack using linked list. 10
4 Demonstrate skip list representation of a dictionary 10
(OR)
5. Explain the algorithm for implementing quadratic probing on a hash table 10
6 Differentiate between splay tree and red-black tree. 10
(OR)
7 With suitable examples, illustrate right-left rotation on AVL tree. 10
8 Write an algorithm for merge sort and explain with a suitable example 10
(OR)
9 Make a comparison of breadth first search and depth first search for a graph 10
10 Describe the Knuth-Morris-Pratt algorithm for pattern matching. 10
(OR)
11 Illustrate the Brute force algorithm. 10
