[go: up one dir, main page]
Scribd
Upload
22 views1 page

Adsa Au3

This document contains instructions for an exam on advanced data structures and algorithms. It lists 10 questions across 5 units. For each question, students must answer all parts at one place. The questions cover topics like linked lists, stacks, queues, trees, searching, sorting, hashing, priority queues, B-trees, AVL trees, and red-black trees. Students are asked to discuss operations, compare complexities, apply algorithms, illustrate concepts, and construct data structures with examples.

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
22 views1 page

Adsa Au3

This document contains instructions for an exam on advanced data structures and algorithms. It lists 10 questions across 5 units. For each question, students must answer all parts at one place. The questions cover topics like linked lists, stacks, queues, trees, searching, sorting, hashing, priority queues, B-trees, AVL trees, and red-black trees. Students are asked to discuss operations, compare complexities, apply algorithms, illustrate concepts, and construct data structures with examples.

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

H.T.

No: Course Code: 192CS1T02

ADITYA ENGINEERING COLLEGE (A)


M.Tech – I Semester End Examinations Regular & Supple (AR19) – AUG 2021

ADVANCED DATA STRUCTURES AND ALGORITMS


(Computer Science Engineering)
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 Discuss about the different operations of Singly Linked List with suitable K6 CO1 [7M]
examples
b Explain the Queue Implementation with suitable examples. K2 CO1 [5M]
OR
2 a Discuss about the various operations of Doubly Linked Lists. K6 CO1 [7M]
b Explain the stack implementation with suitable examples. K2 CO1 [5M]

UNIT – II
3 a Compare the complexities of Bubble sort, Insertion sort and Selection Sort. K5 CO2 [7M]
b Define Tree. list out different kinds of trees K1 CO2 [5M]
OR
4 a Apply the Binary search to search the given key element in the given list of K3 CO2 [6M]
elements 5, 12, 17, 23, 38, 44,77, 84 and 99.
b Demonstrate the concept of Depth First Search on an example Graph K2 CO2 [6M]

UNIT – III
5 a Discuss about Queue ADT. K6 CO3 [4M]
b Discuss various collision resolution techniques in detail. K6 CO3 [8M]
OR
6 a Discuss about stack ADT K6 CO3 [5M]
b Illustrate the differences between open addressing and closed addressing. K2 CO3 [7M]

UNIT – IV
7 a List out the different ways of implementing Priority Queues K4 CO4 [4M]
b Illustrate the in-order, pre-order and post order traversal techniques with K2 CO4 [8M]
suitable Binary Search Tree
OR
8 a Define Priority Queue. Explain the concept of Max Heap. K2 CO4 [6M]
b Construct a Binary Search Tree for following elements 50, 15, 62, 5, 20, 58, K6 CO4 [6M]
91, 3, 8, 37, 60, and 24 in detail.

UNIT – V
9 a Define B- tree. Explain B-trees with suitable example. K2 CO5 [7M]
b Explain various rotations in AVL tree K2 CO5 [5M]
OR
10 a Construct Red-Black tree by inserting some set of elements. K6 CO5 [6M]
b Explain insertion and deletion operation of an AVL tree with suitable K2 CO5 [6M]
example.
*****

You might also like