Scribd
Upload
12 views

Cycle test 1 ADSA

reference

Uploaded by

prathy1018
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
12 views

Cycle test 1 ADSA

reference

Uploaded by

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

Reg. No. Reg. No.

CHENDHURAN COLLEGE OF ENGINEERING AND TECHNOLOGY CHENDHURAN COLLEGE OF ENGINEERING AND TECHNOLOG Y
Pilivalam (Po), Thirumayam (Tk), Pudukkottai (Dt.) – 622 507. Pilivalam (Po), Thirumayam (Tk), Pudukkottai (Dt.) – 622 507.
I YEAR M.E CSE-2024-2025-I-SEM I YEAR M.E CSE-2024-2025-I-SEM
CP4151-ADVANCED DATA STRUCTURE AND ALGORITHM CP4151-ADVANCED DATA STRUCTURE AND ALGORITHM
CYCLE TEST-I CYCLE TEST-I
Date: - Date: -
Time: 3 hours Time: 3 hours
Marks: 100 Marks: 100

PART-A (10x2=20 Marks) 13. a) How efficiency of algorithm is measured? write in detail about
1. What are the recursion trees to be used? asymptotic notation with suitable illustration?
2. Differentiate data, data type, and data structure?
(OR)
3. Write the properties of red black trees?
Why b-tree data structure is preferred for database index and 13. b) How recursive can be solved? Explain the substitution method for
4.
access?
solving recurrence?
Write an algorithm to find prime number and find its time
5.
complexity? 14. a) different best, average and worst-case running time analysis and
Write a recursive program to find the GCD of two
6. explain how the three analysis can be done for linear search and binary
numbers?
When you can claim a binary tree as a min-heap and address about search of an array?
7.
it?
8. Write the time complexity of Fibonacci heap for any two operation? (OR)
9. Define DAG? 14. b) write about deleting a key from tree from a b-tree heap?
10. What is meant by recursion?
15.a ) outline to steps to construct a Fibonacci heap with an example?
PART B – (5 13=65) (OR)
15 b) write and briefly explain binary search tree and their querying also?
11.a) describe about the asymptotic used for algorithm analysis. Give an
example?
(OR) PART C – (1 × 15= 15 marks)
11.b) What is recurrence? List the methods for solving recurrence? 16.a) Write the insertion sort algorithm and derive its best. worst and average
case time complexities.
12.a) Insert into a B-tree of order 5 with the following data 8, 96, 116, 2, 7, (OR)
104, 110,37, 86, 55, 46, 137, 145, 4, 5, 58, 6?
16.b) Mention the advantaged of red black tree over binary search tree construct
(OR)
a red black tree using the following set of element10,12,1,14,6,5,8,15,3,11,13
12.b) Write the psuedo code for inserting a node to a Red Black Tree.? and 2?

You might also like