Algorithms: Design and Analysis, Part 2

Course
en
English
36 h
This content is rated 0 out of 5
Source
  • From www.coursera.org
Conditions
  • Self-paced
  • Free Access
  • Free certificate
More info
  • 6 Sequences
  • Introductive Level

Their employees are learning daily with Edflex

  • Safran
  • Air France
  • TotalEnergies
  • Generali
Learn more

Course details

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.

Prerequisite

None.

Instructors

  • Tim Roughgarden - Computer Science

Editor

Leland Stanford Junior University, better known as Stanford University, is a private American university located in Silicon Valley, south of San Francisco.

Its motto is "Die Luft der Freiheit weht", which means "The wind of freedom blows".

Ranked among the world's top universities in most international rankings, it enjoys great prestige.

Platform

Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California. 

Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.

This content is rated 4.5 out of 5
(no review)

What did you think of this course?

Complete this resource to write a review