Scribd
Upload
39 views2 pages

DAA Assignment Questions

The document outlines the first assignment questions for DAA BCS401, with a submission date of May 5, 2025. It includes tasks such as defining algorithms, designing recursive and iterative algorithms for various sorting methods, analyzing time efficiency, and discussing AVL trees and their rotations. Additionally, it requires applying specific algorithms to given data sets and solving recurrence relations using the Master theorem.

Uploaded by

meghanatgowda1028
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
39 views2 pages

DAA Assignment Questions

The document outlines the first assignment questions for DAA BCS401, with a submission date of May 5, 2025. It includes tasks such as defining algorithms, designing recursive and iterative algorithms for various sorting methods, analyzing time efficiency, and discussing AVL trees and their rotations. Additionally, it requires applying specific algorithms to given data sets and solving recurrence relations using the Master theorem.

Uploaded by

meghanatgowda1028
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

1st Assignment questions: DAA BCS401

Submission date: 5/5/2025


1. Define Algorithm. List properties of an algorithm. Also explain algorithm design and analysis
process with a neat diagram.
2. Design a recursive algorithm for finding factorial of a number and analyze mathematically.

3. Give the general plan for analyzing time efficiency of recursive algorithms and also analyze
the tower of Hanoi recursive algorithm.
4. Design an algorithm for Selection Sort. Apply the same to solve the given array 79, 35, 58,
80, 19, 24, 7.

5. Apply Strassen’s matrix multiplication to multiply the following matrices. Show the details of
the computation.

6. State Masters theorem and apply the same to solve the following recurrence relation
a. T(n)= 4T(n/2)+n
b. T(n)=8T(n/2)+n²
7. Apply Quick Sort on the following list and show the steps of sorting 50,30,10,90,80,20,40,70.
Derive the worst and best case time complexity for the same.
8. Design an algorithm for Merge Sort and discuss the efficiency of it for following array list: 60, 50,
25, 10, 35, 25, 70, 30.
9. Write an iterative algorithm to find maximum item in the array 22,13,-5,-8,15,60,17,31,47.
10. What are AVL Trees. Explain 4 types of Rotations in AVL Tree.
11. Design an algorithm for Bubble Sort and discuss the efficiency for following array list: 72, 85, 24,
32, 16, 40

12. Apply Insertion Sort on the given array and show the steps of sorting 89,45,68,90,29,34,17. Write
the algorithm for the same.
13. Design a non-recursive algorithm for element uniqueness problem and Analyze mathematically
14. Define binary tree. Traverse and Write the Pre-order, In-order and Post-order traversal for the
given tree.

You might also like