**Coursera - Algorithm Design & Analysis Part 2**

MP4 | AVC 76kbps | English | 960x540 | 29.97ps | 19h 04mins | AAC stereo 108kbps | 1.67 GB

*Genre: Video Training*

In this course you will learn several fundamental principles of advanced algorithm design. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression. You'll learn the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments. You'll learn what NP-completeness and the famous "P vs. NP" problem mean for the algorithm designer. Finally, we'll study several strategies for dealing with hard (i.e., NP-complete problems), including the design and analysis of heuristics. Learn how shortest-path algorithms from the 1950s (i.e., pre-ARPANET!) govern the way that your Internet traffic gets routed today; why efficient algorithms are fundamental to modern genomics; and how to make a million bucks in prize money by "just" solving a math problem!

**Course Syllabus:**

Weeks 1 and 2: The greedy algorithm design paradigm. Applications to optimal caching and scheduling. Minimum spanning trees and applications to clustering. The union-find data structure. Optimal data compression.

Weeks 3 and 4: The dynamic programming design paradigm. Applications to the knapsack problem, sequence alignment, shortest-path routing, and optimal search trees.

Weeks 5 and 6: Intractable problems and what to do about them. NP-completeness and the P vs. NP question. Solvable special cases. Heuristics with provable performance guarantees. Local search. Exponential-time algorithms that beat brute-force search.

Recommended Background

How to program in at least one programming language (like C, Java, or Python); and familiarity with proofs, including proofs by induction and by contradiction. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors. The course assumes familiarity with some of the topics from Algo 1 --- especially asymptotic analysis, basic data structures, and basic graph algorithms.

**Download link:**

**Rapidgator:**

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part01.rar.html

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part02.rar.html

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part03.rar.html

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part04.rar.html

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part05.rar.html

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part06.rar.html

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part07.rar.html

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part08.rar.html

**Uploadable.ch:**

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part01.rar

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part02.rar

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part03.rar

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part04.rar

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part05.rar

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part06.rar

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part07.rar

5aglk.Coursera..Algorithm.Design..Analysis.Part.2.part08.rar

**Links are Interchangeable - Single Extraction - Premium is support resumable**

Comments