Algorithms by Abdul Bari:

Videos

11 June 2019 –watched till 1.4

Unit 1: about 120 minutes – Intro and Characteristics of Algorithms (can skip some parts for Adhish
currently – so much detail of complexity may not be required for our purpose).

1.8 – Asymptotic Notations ; 1.12 – Disjoint Sets

Unit 2: Divide and Conquer – recursive solution

Unit 3 – Greedy Method

Unit 4 – Multistage Graph – Dynamic Programming

Unit 5 – Graph Traversals

Unit 6 – Backtracking – Brute Force Method

Unit 7 – Branch and Bound

Unit 8 – NP Hard and NP Complete

Unit 9 – String Matching

Unit 10 – Trees

(78 – 83 – simplified)

Algorithms vs. Program:

– Design vs. Implementation

- Domain Knowledge vs. Programmer

- Any language vs. programming language

- Priori Analyze vs. Posteriori testing

First design and then implement (i.e. Program)