0 Up votes0 Down votes

10 views4 pagesFeb 06, 2018

© © All Rights Reserved

PDF, TXT or read online from Scribd

© All Rights Reserved

10 views

© All Rights Reserved

- The Woman Who Smashed Codes: A True Story of Love, Spies, and the Unlikely Heroine who Outwitted America's Enemies
- Steve Jobs
- NIV, Holy Bible, eBook
- NIV, Holy Bible, eBook, Red Letter Edition
- Hidden Figures Young Readers' Edition
- Cryptonomicon
- Make Your Mind Up: My Guide to Finding Your Own Style, Life, and Motavation!
- The Golden Notebook: A Novel
- Alibaba: The House That Jack Ma Built
- The 10X Rule: The Only Difference Between Success and Failure
- Autonomous: A Novel
- Hit Refresh: The Quest to Rediscover Microsoft's Soul and Imagine a Better Future for Everyone
- Hit Refresh: The Quest to Rediscover Microsoft's Soul and Imagine a Better Future for Everyone
- Life After Google: The Fall of Big Data and the Rise of the Blockchain Economy
- Algorithms to Live By: The Computer Science of Human Decisions
- Console Wars: Sega, Nintendo, and the Battle that Defined a Generation
- The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution

You are on page 1of 4

ADVANCE DATA STRUCTURE

(Com. to CSE, IT)

Time: 3 hours Max. Marks: 70

Note: 1. Question Paper consists of two parts (Part-A and Part-B)

2. Answer ALL the question in Part-A

3. Answer any THREE Questions from Part-B

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART –A

1. a) What are the methods used to represent Dictionary? (4M)

b) Give Time complexities of AVL trees? (3M)

c) Discuss the properties of Binomial tree. (4M)

d) For a sample graph, represent an adjacency matrix. (3M)

e) What is best case and worst case analysis of quick sort? (4M)

f) Give, applications for pattern matching. (4M)

PART -B

2. a) What is a hash table? What is hash function? What is bucket and home bucket? (8M)

b) With example, explain folding and rotation hashing methods. (8M)

3. a) How do you represent AVL tree and what will be the height of AVL tree. (8M)

b) Write the AVL tree insertion algorithm. (8M)

4. a) Explain reheap up, reheap down operations and show the heap implementation (8M)

steps using arrays.

b) Explain parental property of a heap. Give the difference between complete binary (8M)

tree and almost complete binary tree.

b) How to find shortest path between vertices using all pairs shortest path floyd’s (8M)

algorithm.

6. a) Write heap sort algorithm and analyze the time complexity. (10M)

b) Explain heap sort using following elements. 78, 32, 56, 8, 23, 45 (6M)

b) Explain error handling during file I/O. (8M)

1 of 1

||''|'''|''|'|''''||

Code No: RT22053 R13 SET - 2

ADVANCE DATA STRUCTURE

(Com. to CSE, IT)

Time: 3 hours Max. Marks: 70

Note: 1. Question Paper consists of two parts (Part-A and Part-B)

2. Answer ALL the question in Part-A

3. Answer any THREE Questions from Part-B

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART –A

1. a) What are the applications of Dictionary? (4M)

b) Explain the properties of 2-3 trees. (3M)

c) What is a priority queue? (4M)

d) What is path, cycle, loop and Adjacency vertex of a graph. (4M)

e) What is the best sorting algorithm? Why? (4M)

f) Define tries. (3M)

PART -B

2. a) When collision will occur? Explain quadratic probing with example. (8M)

b) With example explain how insertion and deletion operations performed on (8M)

dictionaries.

3. a) Discuss how the deletion operation performed in 2-3 tree with example. (8M)

b) Discuss how single and double rotations performed in AVL trees. Give some (8M)

applications of AVL tree

4. a) Construct a binary heap with the following values: 23, 7, 92, 6, 12, 14, 40, 44, 20, (8M)

21

b) What are the applications of priority queue and binomial queue? (8M)

b) How to find shortest path between two vertices using Dijkstra’s algorithm? (8M)

6. a) Perform quick sort using the following elements. 78, 21, 14, 97, 87, 62, 74, 85, 76, (8M)

45, 84, 22

b) Give best case, Average case analysis of quick sort. (8M)

7. a) Give a brief description on pattern matching problem and explain Boyer-moor (8M)

algorithm with an example.

b) Discuss fundamental file processing operations. (8M)

1 of 1

||''|'''|''|'|''''||

Code No: RT22053 R13 SET - 3

ADVANCED DATA STRUCTURES

(Com. to CSE, IT)

Time: 3 hours Max. Marks: 70

Note: 1. Question Paper consists of two parts (Part-A and Part-B)

2. Answer ALL the question in Part-A

3. Answer any THREE Questions from Part-B

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART –A

1. a) Explain the characteristics of good hashing function. (4M)

b) Define 2-3 tree. (3M)

c) List all the operations performed in binomial heap. (3M)

d) What is the need of minimum-cost spanning tree. (4M)

e) Explain the difference between quick sort and merge sort. (4M)

f) Give some applications of Digital search trees. (4M)

PART –B

2. a) Explain about a skip list with an example. Give applications of skip list. (8M)

b) With example explain how insertion and deletion operations performed in skip list. (8M)

3. a) Explain with example, what are the different cases followed while inserting a node

in 2-3-Tree. (8M)

b) Create a 2-3 tree from the following list of data items

5,6,8,21,12,30,34,27,23,4,33,7,24,9,10,11,13,38

(8M)

4. a) What is binomial queue? Discuss binomial amortized analysis. (8M)

b) What is a priority queue? Explain operations performed in priority queue.

(8M)

5. a) Explain kruskal’s algorithm with example. (8M)

b) Define Graph? Discuss about weakly connected, strongly connected, Disjoint

Graphs.

(8M)

6. a) What is divide and conquer strategy? Explain merge sort using following elements

10, 5, 7, 6, 1, 4, 8, 3, 2, 9 (8M)

b) Discuss the analysis for merge sort.

(8M)

7. a) Explain KMP algorithm with example. (8M)

b) Discuss all files/classes present in iostream header file.

(8M)

1 of 1

||''|'''|''|'|''''||

Code No: RT22053 R13 SET - 4

ADVANCED DATA STRUCTURES

(Com. to CSE, IT)

Time: 3 hours Max. Marks: 70

Note: 1. Question Paper consists of two parts (Part-A and Part-B)

2. Answer ALL the question in Part-A

3. Answer any THREE Questions from Part-B

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART –A

1. a) Write short notes on Skip list. (4M)

b) Define an AVL Tree. (3M)

c) Discuss about binary heap. (4M)

d) For an example graph, represent possible spanning trees. (4M)

e) Give time complexity for merge sort (3M)

f) What are the pointers associated with random access binary files. (4M)

PART –B

2. a) Consider the given values 72, 27, 36, 24, 63, 81, 92, 101 and perform linear,

quadratic probing operations in a given hash table of size 10. (8M)

b) With example, explain modulo division and digit extraction hashing methods. (8M)

3. a) Build an AVL tree with the following values 15, 20, 24, 10, 13, 7, 30, 36, 35. (8M)

b) Explain about deletion procedure in AVL tree. With example explain deletion (8M)

operation in AVL tree.

b) Perform insert and delete operations on binomial queue by taking an example. (10M)

b) Explain Prim’s algorithm with an example. Give analysis of prim’s algorithm (10M)

6. a) Explain Radix sort using following elements. 45, 37, 05, 09, 06, 11, 18, 27 (8M)

b) Give algorithm for Radix sort. Discuss the analysis of radix sort (8M)

7. a) Explain how to manage fixed field and fixed length buffers, (8M)

b) What are the advantages and disadvantages of tries with respect to binary search (8M)

trees

1 of 1

||''|'''|''|'|''''||

- Introduction to Algorithms and Problem SolvingUploaded byNoman Ali
- 3 Idiots Approach Display Advertising ChallengeUploaded byshafiahmedbd
- Priority queue Heap sortingUploaded byHassan
- DSA Assignment I006Uploaded bySanket Chavan
- Data Structures - GeeksforGeeksUploaded byNagaraj
- Report [Insertion Merge Quick] revised version.pdfUploaded byTosin Amuda
- Graph and HeapUploaded byRajan Jaiprakash
- Course Handout DSUploaded byvaibhav0206
- Algor-2016 Searching Sorting Dengan ArrayUploaded byLelianto Eko Pradana
- unit-V -Uploaded bymayank yadav
- Recursion Trees and Master MethodUploaded byHarsh Vardhan Jha
- Collection of Cs Multiple Choice Questions McqsUploaded byShuseel Baral
- V 04404131134Uploaded byAnonymous 7VPPkWS8O
- AlgoBook Cormen DijkstraUploaded byDeez Nuts
- MC0080Uploaded bySorokhaibam Thouba Meetei
- ThingUploaded byquincy
- Data Structures and Data ManipulationUploaded byRajiv Beeharee
- Hadoop PreTestUploaded byAshok Kumar K R
- COURSE NOTES - CS2604. Data Structures and File Processing (Java Edition, 1998)Uploaded byHunaid Elkamushi
- Design and Analysis of Purely Functional Programs.pdfUploaded bymek mek
- Sorting 2Uploaded byFazrul Rosli
- Lecture7 - Sorting AlgorithmsUploaded byMrZaggy
- FrontUploaded byKevin Ortega Rodriguez
- 10 SortingUploaded byelasu85
- Data Structures and the Java Collections Framework.9780470482674.56071Uploaded bynilsmart
- Algorithm and Data Structures ListUploaded byRahman M.
- CHAP8_PartIIUploaded byYuri Boyka
- MockUploaded byRekha Perumal Vijayan
- DecisionTreePrimer-3Uploaded bytsar_philip2010
- iterlevel2Uploaded byakg299

- 035Uploaded byalp_alp
- ADVANCE DATA STRUCTURE_APRIL-2016.pdfUploaded byalp_alp
- 332 1Uploaded byalp_alp
- AbstractUploaded byalp_alp
- 331830786asst.eng.advt.Uploaded bySamuel Vivek
- QP1Uploaded byjani28cse
- machine design.pdfUploaded byalp_alp
- A Good Paper for Applied Thermal Engineering (1)Uploaded byalp_alp
- 81769_DIPLOMA_IN_EEE.docxUploaded byalp_alp
- 61193-223955-1-PBUploaded byalp_alp
- 10.5923.j.ajsp.20160602.02Uploaded byalp_alp
- 4-1 2nd Mid Automobile Engg Day-1Uploaded byalp_alp
- 467Uploaded byalp_alp
- Deee e2 Lab c16 Manual ModifyUploaded byalp_alp
- 172-1186-1-PBUploaded byalp_alp
- Basic Electronics and Devices_dec_2015Uploaded byalp_alp
- b3 Automatic RailwayUploaded byalp_alp
- Ads-qp-2015Uploaded byChristina Robinson
- 2-2-14-363 nov (2)Uploaded byalp_alp
- Guide to Unix_Commands_File System Utilities - Wikibooks, Open Books for an Open WorldUploaded byalp_alp
- Ratified Principals & FacultyUploaded byalp_alp
- 15.pdfUploaded byg
- week7.pdfUploaded byalp_alp
- 16.pdfUploaded byg
- ME231 Lecture 34Uploaded byalp_alp

- Algo QuicksheetUploaded byfang
- Lecture 1Uploaded byAvishay Alon
- Database Indexes.pdfUploaded bySuperman X-Men
- Binomial Pramod PptUploaded bypramodtripathi7
- CSE-II-I-DS-UNIT-5.pdfUploaded bybskc_sunil
- austin hasemeyer final summer b 17Uploaded byapi-376386038
- Idst 2016 SA 05 HashingUploaded byA Sai Bhargav
- 22 SlideUploaded byHoàng Vũ
- b+ tree insertion & deletionUploaded bySubhash Singh
- Data StructuresUploaded bykrayya
- 02-Trajectory Data Mining-Trajectory Data ManagementUploaded byusernameuserna
- Rebalancing BSTUploaded bybrodskye
- How to Vlookup in Excel - A Step by Step TutorialUploaded byanuragt_5
- CFG-pumpingUploaded bySonaiya Mahesh
- The Common Comlexities HandoutUploaded byNorbert
- Data StructuresUploaded byAmogh Sk
- mysql group byUploaded bysky.jian
- 3408-Data StructureUploaded bycomtotapel
- Sample Data Structures and Algorithms Made EasyUploaded byawilsm
- 2015 Autumn CSC203 Course OutlineUploaded byMashruk Kabir
- 2-1BinarySearchTreesUploaded bymohamed.khalid
- 04 TreesUploaded byThobius Joseph
- 1-Lecture 4 - Linked List - SingleUploaded bychandru5g
- Amortized Splay TreesUploaded byashodhiya14
- ArvoresUploaded bycoisadata
- CS502 Quiz No.1 30-04-2012Uploaded bySohail Ahmad
- MaulisaDewi-17482Uploaded byNadia Elaesiana
- Cs33- Data Structures Questions and AnswersUploaded bysri1bhu2
- Linked QueueUploaded bySoubhik Biswas
- Binary Search TreesUploaded byAsafAhmad

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.