Scribd
Upload
335 views2 pages

DS Question Paper

1. This document is an exam for a Data Structures course, consisting of 2 parts worth a total of 60 marks. 2. Part A contains 10 multiple choice questions worth 1 mark each about various data structures topics. 3. Part B contains longer answer questions worth 5-10 marks each. Questions involve implementing stack functions, hash tables, B-trees, AVL trees, and other data structures algorithms and their analysis.

Uploaded by

anithaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
335 views2 pages

DS Question Paper

1. This document is an exam for a Data Structures course, consisting of 2 parts worth a total of 60 marks. 2. Part A contains 10 multiple choice questions worth 1 mark each about various data structures topics. 3. Part B contains longer answer questions worth 5-10 marks each. Questions involve implementing stack functions, hash tables, B-trees, AVL trees, and other data structures algorithms and their analysis.

Uploaded by

anithaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Code:C0510 MR 22

MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS)


B.TECH II YEATR I SEMESTER REGULAR EXAMINATIONS, FEB-2024
SUBJECT: DATA SRUCTURES
(Common to CSE,IT,CSE(CS),CSE(AIML),CSE(DS)CSE(IOT))
Duration: 3 Hours Max. Marks:60

Part A 10 X 1 =10 Marks


Answer all the questions
Q Questions Marks Bloom
No ’s CO
Taxon
omy
Level
1 List out the applications of stacks. 1 L2 1
2 Define Abstract Data Type. 1 L1 1
3 List different collision resolution techniques 1 L1 2
4 What is a dictionary? 1 L1 2
5 Is the AVL tree the best, or is BST is the best? Justify your answer. 1 L3 3
6 Explain Splay tree? 1 L2 3
7 What is Merge sort worst case time complexity? 1 L1 4
8 Which data structure commonly used to implement BFS? 1 L2 4
9 Explain compressed tries? 1 L2 5
10 What is the time complexity of the brute force pattern matching algorithm? 1 L2 5

Part B
Answer all the questions 5X10M=50Marks

Marks Bloom’s
Questions Taxonomy CO
Q.No
Level
Convert the given expression A+B ^C+(D*E/F)*G into its postfix expression, and
evaluate the postfix expression using stack. Here 10 L4 1
111. A=3,B=5,C=2,D=7,E=4,F=1,g=8.

OR
(a) Implement the stack functions using array 5 L3

112. (b) Distinguish between linear and non linear data structures. 1
5 L5

a) Insert the following list of elements into the hash table by using Quadratic 5
probing (size of Hash table is 13) 65, 34, 79, 114, 26, 85, 55, 89, 22, 98. L3 2
113.
b) Examine skip list operations with an example 5 L4
OR
Construct the rehash table for the input: 30, 20, 56, 75, 31, 19 using the hash
10 L4 2
114. function h(k)= k mod 10
Build a B-Tree of order 5 with the following data items
115 20,30,35,85,10,55,60,25,5,65,70,75,15,40,50,80,45 10 L3 3

OR
a)Design an AVL tree using the following sequence of data
5 L4
63,9,19,27,18,108,99,81 3
116.
b)Illustrate the properties of red black tree with an example 5 L3

a)Describe the procedure of BFS traversal technique with an example 5 L3


117. 4
b) Sort the below elements using quick sort. 5 L4

OR
Construct a Max heap with the following elements
118. 53,78,27,48,55,42,72,62,58,45 10 L4 4

Describe the Boyer – Moore algorithm, highlighting its key features and time
10
119 complexity. L3 5

OR
a) Construct Suffix tries and Standard tries with an example 5 L4
220.
b)Describe the applications of pattern matching algorithms. 5 5
L3

Signature of faculty Signature of HOD

You might also like