- Chapter-01(ppt)
- What is algorithm?
- What kinds of problems are solved by algorithms?
- Properties of Algorithms
- Descriptions of Algorithms
- The Process of Design an Algorithm
- Important Problem Types(Sorting,Searching,String processing,Graph problems)
- Chapter-02(ppt1,ppt2)
- Purpose of Design and Analysis of Algorithms
- How do we analyze an algorithm’s running time?
- Time Efficiency of Nonrecursive Algorithms
- Mathematical analysis of recursive Algorithm
- Idea of master theorem
- Important Recurrence Types
- Chapter-03(ppt)
- Brute Force
- Closest Pair of points
- Sequential Search
- Brute-Force String Matching
- Exhaustive search
|
