Scribd
Upload
33 views1 page

Adsa Au2

This document is an exam paper for an Advanced Data Structures and Algorithms course. It contains 10 questions across 6 units. The questions assess different data structures and algorithms concepts like doubly linked lists, queues, trees, sorting, searching, hashing, binary search trees, heaps, AVL trees, and red-black trees. Students must answer 1 question from each unit, with each question worth either 12 or 6 marks depending on the concept and requirements.

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

Adsa Au2

This document is an exam paper for an Advanced Data Structures and Algorithms course. It contains 10 questions across 6 units. The questions assess different data structures and algorithms concepts like doubly linked lists, queues, trees, sorting, searching, hashing, binary search trees, heaps, AVL trees, and red-black trees. Students must answer 1 question from each unit, with each question worth either 12 or 6 marks depending on the concept and requirements.

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) – MAY 2022

ADVANCED DATA STRUCTURES AND ALGORITHMS


(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 What is Doubly Linked List? Write an algorithm to insert and delete a node K2 CO1 [12M]
in Doubly Linked List.
OR
2 What is Queue? Why it is known as FIFO? Write an algorithm to insert and K2 CO1 [12M]
delete an element from a simple Queue.
UNIT – II
3 a Construct a tree for the given inorder and postorder traversals. K3 CO3 [6M]
Inorder : DGBAHEICF
Postorder : GDBHIEFCA
b Discuss following with reference to trees. i) Height of the tree K2 CO3 [6M]
ii) Complete Binary Tree iii) Expression tree iv) Sibling v) Full Binary Tree
OR
4 a Explain Merge Sort with the help of example. K2 CO2 [6M]
b What do you mean by Searching? Explain Binary search with help of K2 CO2 [6M]
example.
UNIT – III
5 Explain the linear and quadratic probing techniques for Collision-resolution K2 CO4 [12M]
in Hashing with example.
OR
6 What is Hashing? Explain Different Hash function method in detail. Explain K2 CO4 [12M]
each one.
UNIT – IV
7 Create a Binary Search Tree for the following data and do in-order, Preorder K3 CO5 [12M]
and Post-order traversal of the tree. 50, 60, 25, 40, 30, 70, 35, 10, 55, 65, 5
OR
8 Construct a Max heap by inserting following elements one by one with an K3 CO5 [12M]
algorithm.
Elements: 6,8,10,4,11,12,14,20,15 & 9
UNIT – V
9 Define an AVL tree. Obtain an AVL tree by inserting one integer at a time K3 CO6 [12M]
in the following sequence.
150, 155, 160, 115, 110, 140, 120, 145, 130, 147, 170, 180. Show all the
steps.
OR
10 Start with an empty Red-Black tree and insert the following keys in the K3 CO6 [12M]
given order:
40, 50, 70, 30, 42, 15, 20, 25, 27, 26, 60, 55. Draw figures depicting the tree
immediately after each insertion and following the rebalancing
*****

You might also like