Scribd
Upload
63 views1 page

Sessional Assignment - 1

This document contains instructions for two tests for a class on advanced data structures and algorithms. The first test asks students to define a binary search tree and explain insertion and deletion operations with examples. The second test asks students to choose three of five questions to answer, covering topics like graph representation, depth-first search, minimum spanning trees, hash functions, binary search trees, and red-black trees.

Uploaded by

achaparala4499
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
63 views1 page

Sessional Assignment - 1

This document contains instructions for two tests for a class on advanced data structures and algorithms. The first test asks students to define a binary search tree and explain insertion and deletion operations with examples. The second test asks students to choose three of five questions to answer, covering topics like graph representation, depth-first search, minimum spanning trees, hash functions, binary search trees, and red-black trees.

Uploaded by

achaparala4499
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

R.V.R. & J.C.

COLLEGE OF ENGINEERING(A), GUNTUR-522 019


I/II M.Tech., CSE ASSIGNMENT TEST # I Time: 45 Mts.
ST
2019-20 (1 Semester) CS511: ADVANCED DATA STRUCTURES & Max.Marks:12
ALGORITHMS
_______________________________________________________________________________________
Answer the following Question.
1 Define Binary Search Tree. Explain insertion and deletion operations of BST [10M]
with examples.
SESSIONAL TEST # I Max.Marks:18
Time: 90 Mnts.
_____________________________________________________________________________________
Answer any three of the following questions.
1 a Show how to represent graphs.
b Write and explain the steps of Depth-first search algorithm.

2 What is MST? Show how to find MST using Krushkals algorithm.

3 a What is a hash function? Write in detail about different hash functions. [3 M]


b Illustrate separate chaining technique with a suitable example. [3 M]

4 a What is a binary search tree? Explain the BST traversal techniques. [6 M]


b Explain the importance of Randomly built binary search trees.

5 a Describe the properties of red-black trees. [4 M]


b Write an algorithm to insert elements into a red-black tree. Trace the [2 M]
working of algorithm with suitable examples.

***

R.V.R. & J.C. COLLEGE OF ENGINEERING(A), GUNTUR-522 019


I/II M.Tech., CSE ASSIGNMENT TEST # I Time: 45 Mts.
2019-20 (1ST Semester) CS511: ADVANCED DATA STRUCTURES & Max.Marks:12
ALGORITHMS
_______________________________________________________________________________________
Answer the following Question.
1 Define Binary Search Tree. Explain insertion and deletion operations of BST [10M]
with examples.
SESSIONAL TEST # I Max.Marks:18
Time: 90 Mnts.
_____________________________________________________________________________________
Answer any three of the following questions.
1 a Show how to represent graphs.
b Write and explain the steps of Depth-first search algorithm.

2 What is MST? Show how to find MST using Krushkals algorithm.

3 a What is a hash function? Write in detail about different hash functions. [3 M]


b Illustrate separate chaining technique with a suitable example. [3 M]

4 a What is a binary search tree? Explain the BST traversal techniques. [6 M]


b Explain the importance of Randomly built binary search trees.

5 a Describe the properties of red-black trees. [4 M]


b Write an algorithm to insert elements into a red-black tree. Trace the [2 M]
working of algorithm with suitable examples.

***

You might also like