7 views

Uploaded by alp_alp

- CSC 201-Design and Analysis of Algorithms-Fall2016
- Priority Queue
- ds cse lab
- Lab Programs
- Barry Wilkinson, Michael Allen-Parallel Programming_ Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition) -Prentice Hall (2004)
- C Questions and Answer-libre
- Sorting
- [IJCST-V3I5P21]:Niharika Singh, DR. R. G. Tiwari
- Lect 01
- D3 Tips and Tricks
- icde05kanon
- 2903-5777-1-SM
- datastructure-100211095005-phpapp02
- 04
- Numpy Reference
- Merge Sort
- datastructurestp-101214003102-phpapp01
- Treeview Tutorial
- Zip
- Augmented Data Structure

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

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

- CSC 201-Design and Analysis of Algorithms-Fall2016Uploaded byAhmed Ajmal
- Priority QueueUploaded byapi-19981779
- ds cse labUploaded byAnna Perez
- Lab ProgramsUploaded byManukumar
- Barry Wilkinson, Michael Allen-Parallel Programming_ Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition) -Prentice Hall (2004)Uploaded byKusum0
- C Questions and Answer-libreUploaded byAshik A Nezzilianz
- SortingUploaded byGio Rabara
- [IJCST-V3I5P21]:Niharika Singh, DR. R. G. TiwariUploaded byEighthSenseGroup
- Lect 01Uploaded byPooja Kuni
- D3 Tips and TricksUploaded byAbhishek Panchal
- icde05kanonUploaded byjilf
- 2903-5777-1-SMUploaded byMSJakn
- datastructure-100211095005-phpapp02Uploaded byakshaygondalia
- 04Uploaded byAnkur Garg
- Numpy ReferenceUploaded byscardig
- Merge SortUploaded byshower
- datastructurestp-101214003102-phpapp01Uploaded byPratik Shah
- Treeview TutorialUploaded byHamdi Yusuf Hamdi
- ZipUploaded byesato1981
- Augmented Data StructureUploaded bySirc Ann Ares
- Interview Questions-data StructureUploaded bySam Roger
- algo.pptUploaded byraj
- A6-R3Uploaded byapi-3782519
- 7144583Uploaded byvkthik
- Algorithms Interview Questions and Answers.pdfUploaded byNiranjan Sharma
- Iit Kgp Cse SyllabusUploaded bysayakju
- Interview PreparationUploaded byThiyaga Rajan
- lec16Uploaded byKamesh Singh Jadoun
- Trees Int ExUploaded byanilm411
- An Optimal Approach For Knowledge Protection In Structured Frequent PatternsUploaded byAI Coordinator - CSC Journals

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

- Stability Analysis of Lotka-Volterra Model With Holling Type II Functional ResponseUploaded byrobert0rojer
- Erlang c Table PDFUploaded byMichael
- Pre-Algebra Lesson 1.9Uploaded by412137
- Data Mining in Education a Review on the Knowledge Discovery PerspectiveUploaded byLewis Torres
- ARTIFICIAL INTELLIGENCE IN GRAVEL PACKINGUploaded byUgomuoh Tochukwu Theophine
- probability basicsUploaded byAmit Singh
- Hana Analytics Data2013Uploaded byIcs Mono
- Dc AnalysisUploaded byJr Callanga
- Milestone Workshop 1 Sem 2 20172018 StudentUploaded byDee Mohd
- Numerical methods for differencial equationsUploaded byJulian C. Pachón
- TOC Assignment No-2Uploaded byDhruv Kuchhal
- DSP Lab QP 12 Final Exam (1)Uploaded byAdarsh Amruth
- IMS2006-109Uploaded byapi-3697505
- Signals and SystemsUploaded byWaqas Kiani
- REVERSIBLE DATA HIDING IN ENCRYPTED IMAGES BY RESERVING ROOM BEFORE ENCRYPTION TECHNIQUE AND LSB MATCHING ALGORITHMUploaded byInternational Jpurnal Of Technical Research And Applications
- ncd_blksUploaded byZomishah Kakakhail
- An Interactive Spreadsheet for Teaching the Forward-Backward AlgorithmUploaded byWEMERSON31
- AlgorithmUploaded bySiva Subramanian
- Sequential quadratic programmingUploaded byUmar Farooq Zia
- A Modified Zero Knowledge Identification Scheme using ECCUploaded byJournal of Computing
- KdVUploaded bykikihapsari
- Chebysev PolynomialsUploaded byGeorge Makrigiorgos
- Cs 171 17 BayesianNetworksUploaded byNorth Remon Mendoza
- (05) Kohn-Sham Equations for DFTUploaded byRikardo Pino Rios
- Algorithms in BioinformaticsUploaded byNeeru Redhu
- Nesterov CD 2012Uploaded bybzsahil
- Math Ma Tics of Sound AnalysisUploaded byhousefusion
- Dise AceUploaded byTechnos_Inc
- IRJET-Improved Fuzzy C-means Algorithm With Local Information And Trade-Off Weighted Fuzzy Factor for Image SegmentationUploaded byIRJET Journal
- Px c 3880681Uploaded bySilvia Adelina Mateescu