Scribd
Upload
24 views

Assignment 4

Uploaded by

kingiref
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
24 views

Assignment 4

Uploaded by

kingiref
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

School of Engineering and Technology

Department of Computer Science and Engineering


Academic Year: 2024-25
BTECH CSE IV
Sem
Subject Name: Design and Analysis of Algorithms Sub Code: CSE 356
Assignment 4
Date of Submission: Max Marks: 30
COURSE OUTCOMES
By the end of the course, students will be able to:

CO 1 Analyze the asymptotic performance of algorithms


Describe the dynamic-programming and Greedy paradigm and explain when an
CO 2
algorithmic design situation calls for it.
CO 3 Demonstrate a familiarity with major algorithms and data structures
CO 4 Apply important algorithmic design paradigms and methods of analysis
CO 5 Discuss NP-complete problems and develop algorithms to solve the problems.
CO 6 Choose appropriate algorithm design techniques for solving problems.

Note: Attempt All Questions.


Q. No. Questions Marks
Q1. Define B-Tree. Create a B-tree start with an empty B-Tree with degree 3 and 6
keys arriving in the following order 1 12 8 2 25 6 14 28 17 7 52 16 48 68
3 26 29 53 55 45
Q2. Explain the notion of disjoin set data structures. Examine the UNION and 6
FIND-SET operations in the linked-list representation of disjoint sets.
Q3. Explain the significance and properties of Red-Black tree. Also differentiate 6
between Red Black tree and AVL Tree

Q4. Determine the steps involved in the insertion of following elements in a red 6
black tree.
1, 11 ,12, 69, 4, 14, 82, 50,59, 3
Q5. Explain the binomial heap and Fibonacci heap with suitable example. 6
Show all steps involved in merging two binomial heaps.

You might also like