Scribd
Upload
4 views1 page

Ada Assignment-3

Uploaded by

devrathod44444444
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
4 views1 page

Ada Assignment-3

Uploaded by

devrathod44444444
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

VIDHYADEEP UNIVERSITY

VIDHYADEEP INSTITUTE OF ENGINEERING


AND TECHNOLOGY
Vidhyadeep Campus, Anita (Kim), Ta. Olpad, Dist. Surat

Subject Name: Analysis and Design of Algorithm Code:3150703/002304505 SEM:5th sem

Assignment-3

ATTEND ANY 6 QUETIONS


1. What is the Divide and Conquer approach, and how is it used in algorithm design?
2. Can you explain the three steps involved in the Divide and Conquer approach?
3. How do you analyse the time and space complexity of a Divide and Conquer
algorithm?
4. What is a recurrence relation, and how is it used in algorithm analysis?
5. Can you explain the different types of recurrence relations (e.g. linear, nonlinear,
homogeneous, inhomogeneous)?
6. How do you use the Iteration Method to solve recurrence relations?
7. Can you explain the Binary Search algorithm and its time complexity?
8. How do you implement Binary Search on a sorted array?
9. Can you explain the Max-Min problem and its applications?
10. How do you find the maximum and minimum elements in an array?
11. Can you explain the Merge Sort algorithm and its time complexity?
12. Can you explain the Quick Sort algorithm and its average-case time complexity?
13. Can you explain the naive approach to matrix multiplication and its time complexity?

Subject Coordinator H.O.D. (COMP)


PREPARED BY: PROF. COMPUTER ENGINEERING

MAUSAM RANA 1 DEPARTMENT

You might also like