CSE221-Algorithm

• The course delivery plan for this course is:

Course Delivery Plan

• Topics cover in this course:

Asymptotic Notation

Linear Search

Binary Search

Insertion Sort

Quick Sort

Merge Sort

Greedy Method-Coin change+ Haffman

Dynamic programming- LCS

Dynamic programming-Knapsack Problem

Bin packing problem

Graph Basic-BFS

DFS- and its application

Strongly Connected Component

Topological Sort

Minimum Spanning tree

Dijkstra's Algorithm

Bellmen ford Algorithm

Floyd war-shall Algorithm

NP-complete problem

• Book Reference:

Book Reference-(Core man)

** Some topics are cover only by white board.