Design & Analysis of Algorithms - Vol 3
Engineering · 12 chapters · 108 sections · about 78 hours
Chapters
12 chapters · 108 sections- 1Grid Paths5 sections
- 2Inductive Formulation of the Grid Path16 sections
- 3Common Subwords and Subsequences6 sections
- 4Longest Common Subsequence10 sections
- 5Edit Distance10 sections
- 6Matrix Multiplication7 sections
- 7Linear Programming11 sections
- 8LP Modeling: Production Planning9 sections
- 9Introduction to the Problem7 sections
- 10Network Flows9 sections
- 11Reductions10 sections
- 12Intractability: Checking Algorithms8 sections
About this course
This course will cover basic concepts in the design and analysis of algorithms. Asymptotic complexity, O() notation Sorting and search Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees Design techniques: divide and conquer, greedy, dynamic programming Data structures: heaps, union of disjoint sets, search trees Intractability