VTU Notes | 18CS42 | Design and Analysis of Algorithms.

Divide and Conqueror

Module 2

4.9
2018 Scheme | CSE Department

Created by AcquireHowTo
·
5 Modules

18CS42 | Design and Analysis of Algorithms. Module 2 VTU Notes

A general method, Binary search, Recurrence equation for divide and conquer, Finding the maximum and minimum (T2:3.1, 3.3, 3.4), Merge sort, Quicksort (T1:4.1, 4.2), Strassen’s matrix multiplication (T2:3.8), Advantages and Disadvantages of divide and conquer.

Decrease and Conquer Approach: Topological Sort

Course Faq

Can we download the notes?

Yes, you can download the notes by going to the Module Topics and clicking on the View/Download Module Notes.
How often notes are updated on AcquireHowTo?

We try our best to provide update notes to our users, so we keep updating them once a week.
Do you provide only one specific university note?

No, Our team tries to work hard to provide notes from multiple universities like VTU, IP, DTU, Amity, etc, and from multiple courses like B.E, B.Tech, BBA, MBA, BCA, etc.
Do the Notes you provide belongs to you?

No, the notes we provide belong to the only creator of that notes. May some note belongs to us but not all. AcquireHowTo is a notes providing platform that provide notes from different sources at one place to help the students.