Scribd
Upload
14 views1 page

Mtech 1 Sem Advanced Data Structures Feb 2018

The document outlines the examination structure for the M. Tech. I Semester Regular/Supple Examinations in Advanced Data Structures and Algorithm Analysis for various computer science disciplines. It includes a list of questions covering topics such as linked lists, sorting techniques, hash tables, priority queues, AVL trees, and tree evaluations. Students are required to answer any five questions, each carrying equal marks, within a 3-hour time frame.

Uploaded by

Prudhvi
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
14 views1 page

Mtech 1 Sem Advanced Data Structures Feb 2018

The document outlines the examination structure for the M. Tech. I Semester Regular/Supple Examinations in Advanced Data Structures and Algorithm Analysis for various computer science disciplines. It includes a list of questions covering topics such as linked lists, sorting techniques, hash tables, priority queues, AVL trees, and tree evaluations. Students are required to answer any five questions, each carrying equal marks, within a 3-hour time frame.

Uploaded by

Prudhvi
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

M. Tech.

I Semester Regular/Supple Examinations, Jan/Feb-2018


ADVANCED DATA STRUCTURES/ADVANCED DATA STRUCTURES AND
ALGORITHM ANALYSIS
Common to Information Technology (40), Computer Science (05), Computer Science &
Technology (59) and Computer Science & Engineering (58)
Time: 3 Hours Max. Marks: 60
Answer any FIVE Questions
All Questions Carry Equal Marks

1. a Write an algorithm to insert nodes into a double linked list. 8M


b Explain any one application of Queue with an example. 4M

2. a Implement Quick Sort Technique on the following 20, 6, 89, 32, 65, 92, 8 numbers. 7M
b Implement Insertion Sort Technique on the following 20, 6, 89, 32, 65, 92, 8 5M
numbers.

3. a How do you represent Hash Table? Explain. 6M


b Explain double hashing with an example. 6M

4. Write the procedure to implement priority queue using heap. 12M

5. Explain Insertion, deletion and display procedures of AVL tree. 12M

6. a How do you evaluate Prefix? Explain it with an example. 6M


b How do you compute the height of B Tree? Explain. 6M

7. a Elaborate the significance of Red-Black tree. 6M


b Explain various Hash Functions in detail. 6M

8. a Write the implementation of Circular Linked List. 6M


b Write the pseudo code for Depth First Traversal Technique. 6M

1 of 1

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