M. Tech.

I Semester Regular Examinations, MAR/APRIL-2024

ADVANCED DATA STRUCTURES AND ALGORITHMS

Computer Science & Engineering (58)
Time: 3 Hours Max. Marks: 75

UNIT-I
1 What is a Circular List? Write a program to search in a circular linked list that has a
a 8M
header node? I Semester Regular Examinations, MAR/APRIL-2024
M. Tech.
b Define Queue. Write the advantages and disadvantages of Queues. 7M
ADVANCED DATA STRUCTURES
OR
AND ALGORITHMS
2 a Define stack.Write theComputer
advantages and disadvantages of Queues. 8M
Science & Engineering (58)
Define Single LinkedComputer
List. WriteScience & Engineering
algorithms (58)at the beginning,ending,
to insert a node
b 7M
and at a given position
UNIT-II
3 Define Sorting? Sort the following elements using Quick Sort? Give the time
a complexity of quicksort? 8M
6, 17, 5, 28, 3, 11, 7, 72, 1, 33, 8, 45, 2, 4, 12, 6, 32
b Compare and Contrast the Linear and Binary Search algorithms. 7M
OR
4 Define stack and give one application? Convert the given infix expression to its postfix
a 8M
Expression ((A+((B^C)-D))*(E-(A/C)))
Outline the concept of divide and conquer. Give an algorithm for Merge Sort & trace
b the steps for sorting the following list with time complexity. 39, 9, 81, 45, 90, 27, 72, 7M
18
UNIT-III
5 a Define Stack ADT. Explain basic operations of a Stack ADT. 8M
What is recursion? How it solves the problems? Explain its application in solving
b 7M
Towers of Hanoi problem
OR
6 a Explain the procedure for converting infix expression to prefix expression. 8M
Following elements are inserted into an empty hash table with hash function f(x) = x%
b 7M
17 and quadratic probing. Explain. 58, 48, 79, 46, 54, 32, 24, 19, 18, 35, 15, 84, 16, 12
UNIT-IV
7 What is a Binary Search Tree? Draw a binary search tree when the following keys are
a inserted in order 43, 75, 19, 36, 8, 62, 49, 84, 12, 18, 29. How can a binary search tree 8M
be used for sorting the keys?
What is Priority Queue? Explain the implementation of Priority queue .Write an
b 7M
algorithm for Performing various operations on Priority queues with an example
OR
8 a Explain Min Heap and perform the Insert and Delete operations on Min Heap 8M
Show the result of 3 , 1 , 4 , 6 , 9 , 2 , 5 , 7 each insertion? Also show the result after
b 7M
deletion of the root?
UNIT-V
9 a Describe the B-Trees with an example. 8M
b Detail discussion of Operations about Insertion, Deletion and Searching with example 7M
OR
10 a Show the result of inserting 5 , 2 , 4 , 7, 9 , 1 , 6 , 8 into an initially empty AVL tree? 8M
b Comparison of Search Trees with suitable examples. 7M

2 of 2
 M. Tech. I Semester Regular Examinations, MAR/APRIL-2024
ADVANCED DATA STRUCTURES AND ALGORITHMS
Computer Science & Engineering (58)
Time: 3 Hours Max. Marks: 75

UNIT-I
1 Define Single Linked List. Write algorithms to delete a node at the beginning,ending, and at
a 8M
a given positionI Semester Regular Examinations, MAR/APRIL-2024
M. Tech.
b Discuss the implementation of a circular linked list. 7M
ADVANCED DATA STRUCTURES AND ALGORITHMS
OR
2 a Discuss various Applications
Computerof Queues.
Science & Engineering (58) 8M
Computer Science & Engineering (58)
b Define stack. Write about stack operations position 7M

UNIT-II
3
a Write short notes on Graph terminology and outline the properties of a Graph. 8M

b Explain the implementation of BFT with an example 7M

OR
4 Illustrate Linked List representation and matrix representation of Graphs with an
a 8M
example.

b Explain the implementation of DFT with an example. 7M

UNIT-III
5 a Define queue ADT. Explain basic operations of a queue ADT. 8M
What is recursion? How it solves the problems? Explain its application in solving Towers of
b 7M
Hanoi problem
OR
6 a Explain various Hash Functions in detail. 8M

b Explain Hashing techniques with suitable examples 7M

UNIT-IV
7 What is a Binary Search Tree? Draw a binary search tree when the following keys are
a inserted in order 33, 65, 16, 30, 8, 52, 39, 64, 22, 28, 39. How can a binary search tree be 8M
used for sorting the keys?
What is Priority Queue? Explain the implementation of Priority queue .Write an algorithm
b 7M
for Performing various operations on Priority queues with an example
OR
8 a Explain Min Heap and perform the Insert and Delete operations on Min Heap 8M
Show the result of 3 , 1 , 4 , 6 , 9 , 2 , 5 , 7 each insertion? Also show the result after deletion
b 7M
of the root?
 UNIT-V
9 a How do you compute the height of B Tree? Explain 8M
b How do you evaluate Prefix? Explain it with an example 7M
OR
10 a 5 Explain Insertion, deletion and display procedures of AVL tree 8M
b Comparison of Search Trees with suitable examples. 7M
 UNIT-I
1 Define Single Linked List. Write algorithms to delete a node at the beginning,ending, and at a given
a 8M
position
b Discuss the implementation of a circular linked list. 7M
OR
2 a Discuss various Applications of Queues. 8M

b Define stack. Write about stack operations position 7M

UNIT-II
3
a Write short notes on Graph terminology and outline the properties of a Graph. 8M

b Explain the implementation of BFT with an example 7M

OR
4 Illustrate Linked List representation and matrix representation of Graphs with an
a 8M
example.

b Explain the implementation of DFT with an example. 7M

UNIT-III
5 a Define queue ADT. Explain basic operations of a queue ADT. 8M
What is recursion? How it solves the problems? Explain its application in solving Towers of Hanoi
b 7M
problem
OR
6 a Explain various Hash Functions in detail. 8M

b Explain Hashing techniques with suitable examples 7M

UNIT-IV
7
What is a Binary Search Tree? Draw a binary search tree when the following keys are inserted in order
a 8M
33, 65, 16, 30, 8, 52, 39, 64, 22, 28, 39. How can a binary search tree be used for sorting the keys?

What is Priority Queue? Explain the implementation of Priority queue .Write an algorithm for
b 7M
Performing various operations on Priority queues with an example
OR
8 a Explain Min Heap and perform the Insert and Delete operations on Min Heap 8M
Show the result of 3 , 1 , 4 , 6 , 9 , 2 , 5 , 7 each insertion? Also show the result after deletion of the
b 7M
root?
UNIT-V
9 a How do you compute the height of B Tree? Explain 8M
 b How do you evaluate Prefix? Explain it with an example 7M
OR
10 a 5 Explain Insertion, deletion and display procedures of AVL tree 8M
b Comparison of Search Trees with suitable examples. 7M