DESIGN AND ANALYSIS OF ALGORITHMS

(Effective from the academic year 2018 -2019)

SEMESTER - IV

Course Code 18CS42 CIE Marks 40

Number of Contact Hours/Week 3:2:0

SEE Marks 60

Total Number of Contact Hours 50

Exam Hours 03

18CS42 - DESIGN AND ANALYSIS OF ALGORITHMS

Computer Algorithms/C++, Ellis Horowitz, Satraj Sahni and Rajasekaran, 2nd Edition, 2014,Universities Press

VTU SYLLABUS accordingly Module Wise Text Books....

Ellis Horowitz - Module - 2

Content

Divide and Conquer, General method, Binary search, Recurrence equation for divide and conquer, Finding the maximum and minimum, Merge sort, Quick sort, Strassen’s matrix multiplication, Advantages and Disadvantages of divide and conquer, Decrease and Conquer Approach, Topological Sort,