DESIGN AND ANALYSIS OF ALGORITHMS-LECTURE NOTES

DESIGN AND ANALYSIS OF ALGORITHMS-LECTURE NOTES :

NOTES TAKEN FROM CSE DEPARTMENT OF SSN COLLEGE OF ENGINEERING

E-BOOK-INTRODUCTION TO ALGORITHMS BY CORMEN-AVAILABLE HERE

UNIT-1-NOTES:-
TOPIC-01-BASIC CONCEPTS OF ALGORITHMS-AVAILABLE HERE 
                                                                                       AVAILABLE HERE TOO
TOPIC-02-INTRODUCTION TO ALGORITHMS-AVAILABLE HERE 
TOPIC-03-ALGORITHM ANALYSIS AND COMPLEXITY-AVAILABLE HERE
TOPIC-04-ASYMPTOTIC NOTATIONS-AVAILABLE HERE
TOPIC-05-STANDARD ANALYSIS TECHNIQUES-AVAILABLE HERE
TOPIC-06-ANALYSIS OF ALGORITHMS-RECURRENCES-
                                                                                                     AVAILABLE HERE
TOPIC-07-RECURSIVE ALGORITHMS-AVAILABLE HERE
TOPIC-08-CONDITIONAL ASYMPTOTIC NOTATIONS-AVAILABLE HERE
TOPIC-09-ANALYSIS FRAMEWORK ELEMENTS-AVAILABLE HERE
TOPIC-10-QUESTION BANK-2 AND 16 MARK QUESTIONS-
                                                                                                     AVAILABLE HERE

UNIT-2-NOTES:-
TOPIC-11-DIVIDE AND CONQUER ALGORITHMS-1-AVAILABLE HERE
TOPIC-12-DIVIDE AND CONQUER ALGORITHMS-2-AVAILABLE HERE
TOPIC-13-MIN MAX PROBLEM-AVAILABLE HERE
TOPIC-14-TOP DOWN APPROACH-AVAILABLE HERE
TOPIC-15-DIVIDE AND CONQUER-MERGE SORT-1-AVAILABLE HERE
TOPIC-16-DIVIDE AND CONQUER-MERGE SORT-2-AVAILABLE HERE
TOPIC-17-DIVIDE AND CONQUER-MERGE SORT-3-AVAILABLE HERE
TOPIC-18-GREEDY APPROACH ALGORITHMS-1-AVAILABLE HERE
TOPIC-19-GREEDY APPROACH ALGORITHMS-2-AVAILABLE HERE
TOPIC-20-GREEDY APPROACH ALGORITHMS-3-AVAILABLE HERE
TOPIC-21-GREEDY METHOD-KNAPSACK PROBLEM-AVAILABLE HERE
TOPIC-22-GREEDY METHOD-IN GENERAL-RECAP-AVAILABLE HERE

UNIT-3-NOTES:- 
TOPIC-23-DYNAMIC PROGRAMMING-OBST-AVAILABLE HERE
TOPIC-24-DYNAMIC PROGRAMMING-TSP-AVAILABLE HERE
TOPIC-25-0/1 KNAPSACK PROBLEM-AVAILABLE HERE
TOPIC-26-DYNAMIC PROGRAMMING-EXAMPLES-AVAILABLE HERE
TOPIC-27-DYNAMIC PROGRAMMING-RECAP-AVAILABLE HERE
TOPIC-28-PROBLEMS USING DYNAMIC APPROACH-AVAILABLE HERE
TOPIC-29-MORE ON 0/1 KNAPSACK PROBLEM-AVAILABLE HERE
TOPIC-30-RECAP ON DYNAMIC PROGRAMMING-AVAILABLE HERE

UNIT-4 AND UNIT-5-NOTES:- 
TOPIC-31-CONCEPT OF BACKTRACKING-AVAILABLE HERE
TOPIC-32-MORE ON BACKTRACKING-1-AVAILABLE HERE
TOPIC-33-MORE ON BACKTRACKING-2-AVAILABLE HERE
TOPIC-34-CONCEPT OF BRANCH AND BOUND-AVAILABLE HERE
TOPIC-35-CONCEPT OF GRAPHS-AVAILABLE HERE
TOPIC-36-GRAPH TRAVERSAL TECHNIQUES-AVAILABLE HERE
TOPIC-37-ALGORITHM DESIGN METHODS-AVAILABLE HERE 

                                                   PHOENIX USER