Scribd
Upload
42 views2 pages

Adsa Au1

This document provides instructions and questions for an exam on advanced data structures and algorithms. It is divided into 5 units, with 2 questions per unit. Students must answer one question from each unit. The questions test knowledge of concepts like stacks, queues, linked lists, trees, searching, sorting, hashing, priority queues, AVL trees, red-black trees, B-trees, and splay trees. Students are asked to explain operations, differences between algorithms, provide examples, illustrate concepts with diagrams, construct data structures, perform sorting and searching algorithms, and define key terms. Correct formatting and showing steps are important for receiving full marks.

Uploaded by

sridhar
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
42 views2 pages

Adsa Au1

This document provides instructions and questions for an exam on advanced data structures and algorithms. It is divided into 5 units, with 2 questions per unit. Students must answer one question from each unit. The questions test knowledge of concepts like stacks, queues, linked lists, trees, searching, sorting, hashing, priority queues, AVL trees, red-black trees, B-trees, and splay trees. Students are asked to explain operations, differences between algorithms, provide examples, illustrate concepts with diagrams, construct data structures, perform sorting and searching algorithms, and define key terms. Correct formatting and showing steps are important for receiving full marks.

Uploaded by

sridhar
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/ 2

H.T.

No: Course Code: 192CS1T02

ADITYA ENGINEERING COLLEGE (A)


M.Tech – I Semester End Examination Regular & Supplementary (AR19) – Mar 2023

ADVANCED DATA STRUCTURES AND ALGORITMS


Time: 3 hours Max. Marks: 60
Answer ONE question from each unit
All Questions Carry Equal Marks
All parts of the questions must be answered at one place only

UNIT – I
1 a Explain the concept of stacks with examples. K2 CO1 [5M]
b Illustrate the different operations of doubly linked lists with neat K2 CO1 [7M]
diagrams.
OR
2 a Explain the various operations of queues with examples. K2 CO1 [5M]
b Consider the circular linked lists and illustrate the various operations like K2 CO1 [7M]
searching an element, and deleting an element from the lists with suitable
algorithms.

UNIT – II
3 a Illustrate the differences between linear search and binary search K2 CO2 [6M]
algorithms.
b Define expression tree. Explain the different traversals of a tree. K2 CO3 [6M]
OR
4 a Perform a Simple quick sort algorithm by considering the following K5 CO2 [6M]
elements 3,7,8,5,2, 1, 9, 5, 4 and select 5 as a pivot element
b Demonstrate the concept of Depth First Search with suitable examples. K2 CO3 [6M]

UNIT – III
5 a Define ADT. List out different ADTs K4 CO4 [6M]
b Does the chaining techniques used as a collision resolution. Justify it K5 CO4 [6M]
OR
6 a Discuss the various hash table representation using different hash K5 CO4 [6M]
functions.
b Construct the hash table with the following elements: 101, 93, 74, 50, K3 CO4 [6M]
700,, 85, 76 by applying linear probing technique.

UNIT – IV
7 a Construct a Priority Queue using the concept of Max Heap K3 CO5 [4M]
b Define Binary Search Tree. Explain insertion algorithm in Binary Search K2 CO5 [8M]
Tree.

(P.T.O)
OR
8 a Explain the insertion and deletion operations of a priority queue. K2 CO5 [6M]
b llustrate the inorder, pre-order and post order traversal techniques with K2 CO5 [6M]
suitable Binary Search Tree.

UNIT – V
9 a Write the algorithms for insertion, deletion and searching operations of K6 CO6 [8M]
an AVL tree.
b Define Red-black trees. K1 CO6 [4M]
OR
10 a Compare the two algorithms: B- trees and Splay trees. K2 CO6 [5M]
b Explain the rotation algorithm in an AVL tree. K2 CO6 [7M]
*****

You might also like