# Design and Analysis of Algorithms

0( 0 REVIEWS )
3 STUDENTS

Overview – Framework for Algorithms Analysis – Asymptotic Notation – Algorithm Design Techniques:Basics – Divide And Conquer – Median Finding,Surfing Lower Bounds,Closest Pair – Greedy Algorithms – Pattern Matching -Combinational Search and Optimization – Dynamic Programming – Longest Common Sub sequences – Matric Chain Multiplication – Scheduling with Startup and Holding Costs – Bipartite Maximum Matching – Lower Bounds for Sorting – Element Distinctness Lower Bounds-NP – Completeness -Motivation – Approximation Algorithms – Approximation Algorithms for NP

### Course Curriculum

 Overview Details 51:51 Framework for Algorithms Analysis Details 56:22 Algorithms Analysis Framework – II Details 53:11 Asymptotic Notation Details 53:25 Algorithm Design Techniques : Basics Details 46:24 Divide And Conquer – I Details 52:9 Divide And Conquer -II Median Finding Details 52:55 Divide And Conquer -III Surfing Lower Bounds Details 56:48 Divide And Conquer -IV Closest Pair Details 1:3:38 Greedy Algorithms – I Details 51:19 Greedy Algorithms – II Details 53:58 Greedy Algorithms – III Details 50:44 Greedy Algorithms – IV Details 36:45 Pattern Matching – I Details 54:11 Pattern Matching – II Details 45:2 Combinational Search and Optimization I Details 54:41 Combinational Search and Optimization II Details 54:8 Dynamic Programming Details 52:19 Longest Common Subsequences Details 58:59 Matric Chain Multiplication Details 51:26 Scheduling with Startup and Holding Costs Details 54:2 Bipartite Maximum Matching Details 51:29 Lower Bounds for Sorting Details 48:39 Element Distinctness Lower Bounds Details 54:26 NP-Completeness-I -Motivation Details 58:16 NP – Completeness- II Details 1:16:39 NP – Completeness- III Details 57:24 NP – Completeness- IV Details 1:10:11 NP – Completeness- V Details 41:18 NP – Completeness- VI Details 40:57 Approximation Algorithms Details 55:2 Approximation Algorithms II Details 58:12 Approximation Algorithms for NP Details 53:38

## N.A

ratings
• 5 stars0
• 4 stars0
• 3 stars0
• 2 stars0
• 1 stars0

No Reviews found for this course.

• FREE
• UNLIMITED ACCESS