Scribd
Upload
37 views1 page

Ads 1111

Uploaded by

245123742004
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
37 views1 page

Ads 1111

Uploaded by

245123742004
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/ 1

Code No. M11DB1395 Date: 27.01.

2020

CVR COLLEGE OF ENGINEERING


UGC Autonomous Institution - Affiliated to JNTUH R18

M.Tech. I Yr. I Sem. Main & Suppl. Exams January – 2020 (2019 & 2018 Batches)
Subject: Advanced Data Structures
Branch: DS (IT)
Time: 3 hours Max. Marks: 70
PART – A (10x2 = 20Marks)
(Answer ALL Questions)
1. Highlight the potentialities of double hashing techniques (CO1)
2. Define Hashing. (CO1)
3. List out the need for randomized algorithms. (CO2)
4. What are significances of Deterministic Skip Lists (CO2)
5. What are Splay Trees? (CO3)
6. What is the need of balanced trees? (CO3)
7. Give out the importance of Suffix Tries. (CO4)
8. Define Longest Common Subsequence Problem. (CO4)
9. How is Two-Dimensional Range Searching achieved? (CO5)
10. List out the vitality of k-D trees. (CO5)
PART – B (5x10 = 50 Marks)
(Answer ALL questions)
11. a) Discuss how collision can be resolved using quadratic probing while inserting
following keys in Hash table of size 10: 97, 40, 15, 22, 17, 89, 67 [5+5]
b) Differentiate between linear probing and Quadratic probing. (CO1)
[OR]
12 What is Hashing? Discuss about the rehashing methods with example. (CO1)
13. What is skip list? Explain search and update operations on it. (CO2)
[OR]
14. Write a note on the following. (CO2)
i) Analyze the search time of a skip list [5+5]
ii) Space usage in skip list.

15. a) Build the AVL Tree for the following data. Show the step by step construction
25, 12, 17, 30, 15, 14, 35, 27, 40, 29, 28 (CO3) [5+5]
b) How can keys be inserted into 2-3 trees? Comment on the efficiency of search
operations on 2-3 Trees?
[OR]
16. What is binary search tree? Explain the procedure of insert, delete operations with
example. (CO3)
17. a) Write the pseudo code for Boyer –Moore pattern matching algorithm and explain it
with example. (CO4) [6+4]
b) Discuss about the following
(i) Standard Tries (ii) Compressed Tries
[OR]
18. Explain working principal of The Knuth-Morris-Pratt Algorithm with example.
(CO4)
19. What is priority search tree? Explain the construction procedure with example. (CO5)
[OR]
20. a) What are the different recent Trends in Hashing? Explain (CO5) [5+5]
b. Explain the following.
i) Quadtrees ii) Priority Queues
*****

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy