Scribd
Upload
15 views2 pages

Ads

Uploaded by

doulasj
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
15 views2 pages

Ads

Uploaded by

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

Francis Xavier Engineering College ,Tirunelveli – 627 003

(An Autonomous Institution)


Department of Computer Science and Engineering
Continuous Assessment Test I (CAT-I)
(Regulation 2021)
21CP1601/ Advanced Data Structures and Algorithms

Degree/Dept:M.E/CSE Year/ Semester : First/01


Time: Three hours Maximum: 100 Marks
DATE:21/12/2022
Answer ALL Questions
PART – A (10 x 2 = 20 Marks)
1. What is an Algorithm?
2. How to Analyze an Algorithm?
3. What are the types of Asymptotic Notations?
4. Define Recurrence?
5. List the Recurrence Solution Methods.
6. What are the substitution method?
7. What are the properties of Binary Search Tree?
8. What are the properties of Red-Black Trees?
9. List the basic operations on B- Trees.
10. Define Fibonacci Heap?

PART – B (5 x 13 = 65 Marks)
11. a. Discuss how to Analyze and Design an Algorithm?
OR
b. Explain an Insertion sort with an example.
12. a. Briefly explain the Asymptotic Notations.
OR
b. Explain the Substitution Method with an example.

13. a. Explain the Recursion – Tree Method with an example.


OR
b. Explain the Binary Search tree with an example..

14. a. Descride the Types of Rotations in Red- Black Tree with an example.
OR
b. Explain the concept of Bounding the maximum degree.

15. a. Explain the Red-Black trees with an example.


OR
b. How to decrease a key and delete a node in the Fibonacci Heap.

(P.T.O)
PART – C (1 x 15 = 15 marks)
16. a. Explain B-Trees with an example.

OR

b. Explain the concept of Representations of Elementary Graph Algorithms.

You might also like