Scribd
Upload
22 views

Data Structurescse It Csm Csd Csoacer20

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
22 views

Data Structurescse It Csm Csd Csoacer20

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

II B. Tech- I Semester Supplementary Examination- AUGUST-2024


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) How data structures are classified? 2

b) Name the different abstract data types, 2

c) List out the different ways to implement the list? 2

d) Define Hash functions? 2

e) What operations are performed on Splay trees? 2

f) What is meant by traversing? 2

g) Define Graph? 2

h) What is a max heap? 2

i) What is Compressed Tries? 2

j) What are the merits and demerits of brute force method for pattern matching? 2
Page |2

PART- B MARKS: 5*10=50

Q.No Question Description Marks

2. Define data structure. Discuss different types of data structure their applications. 10

(OR)

3 a) Explain basic operations of queue. List the steps to implement queue using arrays. 5+5
b)Discuss sparse matrix representation using linked list.

4 a) What are the operations performed in skip list? 5+5


b) What are the merits and demerits of array implementation of lists?
(OR)

5. Describe hash table representation. Explain about hash function methods. 10

6 Explain about binary search tree and its operations. 10

(OR)

7 With suitable examples, illustrate right-left rotation on AVL tree. 10

8 Construct max heap for the following: 140, 80 , 30 , 20 ,10 ,40 ,30 ,60 ,100 ,70 ,160 10
,50 , 130, 110, 120
(OR)

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)

11 Solve the Boyer-Moore algorithm for the following 10


Example:
Text: ABCABCDABABCDABCDABDE
Pattern: ABCDABD

You might also like