Design and Analysis of Algorithms

The book contains: Concept Introduction: What is an Algorithm? (T2:1.1) Algorithm Specification (T2:1.2) Analysis Framework (T1:2.1) Performance Analysis: Space complexity Timecomplexity (T2:1.3). Asymptotic Notations: Big-Oh notation (O) Omega notation (Ω) Theta notation (Θ) and Little-oh notation (o) Mathematical analysis of Non-Recursive and recursive Algorithms with Examples (T1:2.2 2.3 2.4). Important Problem Types: Sorting Searching String processing Graph Problems Combinatorial Problems. Fundamental Data Structures: Stacks Queues Graphs Trees Sets and Dictionaries. Divide and Conquer: General method Binary search Recurrence equation for divide and conquer Finding the maximum and minimum (T2:3.1 3.3 3.4) Merge sort Quick sort (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.