Scribd
Upload
31 views2 pages

Data Structurescseitcsmcsd Cso

Uploaded by

sanjaygoud61065
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
31 views2 pages

Data Structurescseitcsmcsd Cso

Uploaded by

sanjaygoud61065
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

Page |1

ACE
Engineering College
(An Autonomous Institution)

ACE-R20
Question Paper Code: CS302PC

Semester End Examination


II B. Tech- I Semester Regular/Supplementary Examination- April -2023
DATA STRUCTURES
(Common to CSE, IT, CSM, CSD & CSO)

Time: 3 Hours Max. Marks: 70


H. T. No
Note: This question paper contains two parts A and B.
1.Part A is compulsory which carries 20 marks. Answer all questions in Part A.
2.Part B consists of 5 Units. Answer any one full question from each unit. Each question carries
10 marks and may have a, b as sub questions

PART- A MARKS: 10*2=20

Q.No: 1 Question Marks

a) Define abstract data type. 2

b) List out the operations that are often specified for ADTs. 2

c) How many levels are there in a skip list? 2

d) Why do we require hash functions in data structures? 2

e) State the differences between binary tree and binary search tree. 2

f) Summarize the advantages and drawbacks of splay tree. 2

g) Compare BFS and DFS. 2

h) Differntiate external sorting and internal sorting. 2

i) Which is the best pattern matching algorithm? Why? 2

j) Distinguish standard and compressed tries. 2


Page |2

PART- B MARKS: 5*10=50

Q.No Question Description Marks

2. Demonstrate the implementation of a singly linked list and inspect the operations 10
performed on a singly linked list.

(OR)
3 a)Develop a program to perform the possible operations on a stack. 5

b) How to represent a queue using the linked list? Discuss in detail. 5

4 Insert the following elements in a Hash Table. Use linear probing technique to 10
resolve collisions, if any. Use division method with table size 10 (%10) as hash
function.27, 37, 6, 25, 14, 35, 48, 57, 76, 116.
(OR)
5. a) Illustrate the insertion , deletion and search operation on a skip list. 5

b) Outline the role of separate chaining in resolving the collision. 5

6 Create a Program to perform all the possible operations on a binary search tree. 10

(OR)
7 a) Calculate the maximum/minimum height for an AVL tree of 3 nodes, 5 nodes, 5
and 7 nodes.
b) Elaborate the implementation of a binary search tree with example. 5

8 Illustrate the approach of various methods used for the representation of a graph. 10

(OR)
9 a)Perform Heap Sort on the given list of elements: 5
34, 45, 17, 88, 80, 60, 55, 12, 10.

b) Analyze the procedure followed in sorting the elements using merge sort. 5

10 Assess the role of the Knuth-Morris-Pratt algorithm in pattern matching 10

(OR)
11 a) Diagnose the mechanism used in Standard Tries and Suffix tries. 5

b). Examine the functionality of the Brute force algorithm with suitable example. 5

You might also like