Über diesen Kurs
23,363 recent views

100 % online

Beginnen Sie sofort und lernen Sie in Ihrem eigenen Tempo.

Flexible Fristen

Setzen Sie Fristen gemäß Ihrem Zeitplan zurück.

Stufe „Fortgeschritten“

Ca. 23 Stunden zum Abschließen

Empfohlen: 4 weeks of study, 4-8 hours/week...

Englisch

Untertitel: Englisch

Kompetenzen, die Sie erwerben

Python ProgrammingLinear Programming (LP)Np-CompletenessDynamic Programming

100 % online

Beginnen Sie sofort und lernen Sie in Ihrem eigenen Tempo.

Flexible Fristen

Setzen Sie Fristen gemäß Ihrem Zeitplan zurück.

Stufe „Fortgeschritten“

Ca. 23 Stunden zum Abschließen

Empfohlen: 4 weeks of study, 4-8 hours/week...

Englisch

Untertitel: Englisch

Lehrplan - Was Sie in diesem Kurs lernen werden

Woche
1
5 Stunden zum Abschließen

Flows in Networks

Network flows show up in many real world situations in which a good needs to be transported across a network with limited capacity. You can see it when shipping goods across highways and routing packets across the internet. In this unit, we will discuss the mathematical underpinnings of network flows and some important flow algorithms. We will also give some surprising examples on seemingly unrelated problems that can be solved with our knowledge of network flows.

...
9 Videos (Gesamt 72 min), 3 Lektüren, 2 Quiz
9 Videos
Network Flows9m
Residual Networks10m
Maxflow-Mincut7m
The Ford–Fulkerson Algorithm7m
Slow Example3m
The Edmonds–Karp Algorithm11m
Bipartite Matching11m
Image Segmentation7m
3 Lektüren
Slides and Resources on Flows in Networks10m
Available Programming Languages10m
FAQ on Programming Assignments10m
1 praktische Übung
Flow Algorithms10m
Woche
2
5 Stunden zum Abschließen

Linear Programming

Linear programming is a very powerful algorithmic tool. Essentially, a linear programming problem asks you to optimize a linear function of real variables constrained by some system of linear inequalities. This is an extremely versatile framework that immediately generalizes flow problems, but can also be used to discuss a wide variety of other problems from optimizing production procedures to finding the cheapest way to attain a healthy diet. Surprisingly, this very general framework admits efficient algorithms. In this unit, we will discuss some of the importance of linear programming problems along with some of the tools used to solve them.

...
10 Videos (Gesamt 84 min), 1 Lektüre, 2 Quiz
10 Videos
Linear Programming8m
Linear Algebra: Method of Substitution5m
Linear Algebra: Gaussian Elimination10m
Convexity9m
Duality12m
(Optional) Duality Proofs7m
Linear Programming Formulations8m
The Simplex Algorithm10m
(Optional) The Ellipsoid Algorithm6m
1 Lektüre
Slides and Resources on Linear Programming10m
1 praktische Übung
Linear Programming Quiz10m
Woche
3
5 Stunden zum Abschließen

NP-complete Problems

Although many of the algorithms you've learned so far are applied in practice a lot, it turns out that the world is dominated by real-world problems without a known provably efficient algorithm. Many of these problems can be reduced to one of the classical problems called NP-complete problems which either cannot be solved by a polynomial algorithm or solving any one of them would win you a million dollars (see Millenium Prize Problems) and eternal worldwide fame for solving the main problem of computer science called P vs NP. It's good to know this before trying to solve a problem before the tomorrow's deadline :) Although these problems are very unlikely to be solvable efficiently in the nearest future, people always come up with various workarounds. In this module you will study the classical NP-complete problems and the reductions between them. You will also practice solving large instances of some of these problems despite their hardness using very efficient specialized software based on tons of research in the area of NP-complete problems.

...
16 Videos (Gesamt 115 min), 2 Lektüren, 2 Quiz
16 Videos
Search Problems9m
Traveling Salesman Problem7m
Hamiltonian Cycle Problem8m
Longest Path Problem1m
Integer Linear Programming Problem3m
Independent Set Problem3m
P and NP4m
Reductions5m
Showing NP-completeness6m
Independent Set to Vertex Cover5m
3-SAT to Independent Set14m
SAT to 3-SAT7m
Circuit SAT to SAT12m
All of NP to Circuit SAT5m
Using SAT-solvers14m
2 Lektüren
Slides and Resources on NP-complete Problems10m
Minisat Installation Guide10m
1 praktische Übung
NP-complete Problems12m
Woche
4
5 Stunden zum Abschließen

Coping with NP-completeness

After the previous module you might be sad: you've just went through 5 courses in Algorithms only to learn that they are not suitable for most real-world problems. However, don't give up yet! People are creative, and they need to solve these problems anyway, so in practice there are often ways to cope with an NP-complete problem at hand. We first show that some special cases on NP-complete problems can, in fact, be solved in polynomial time. We then consider exact algorithms that find a solution much faster than the brute force algorithm. We conclude with approximation algorithms that work in polynomial time and find a solution that is close to being optimal.

...
11 Videos (Gesamt 119 min), 1 Lektüre, 2 Quiz
11 Videos
2-SAT10m
2-SAT: Algorithm12m
Independent Sets in Trees14m
3-SAT: Backtracking11m
3-SAT: Local Search12m
TSP: Dynamic Programming15m
TSP: Branch and Bound9m
Vertex Cover9m
Metric TSP12m
TSP: Local Search6m
1 Lektüre
Slides and Resources on Coping with NP-completeness10m
1 praktische Übung
Coping with NP-completeness6m
4.6
69 BewertungenChevron Right

40%

nahm einen neuen Beruf nach Abschluss dieser Kurse auf

57%

ziehen Sie für Ihren Beruf greifbaren Nutzen aus diesem Kurs

25%

erhalten Sie eine Gehaltserhöhung oder Beförderung

Top reviews from Advanced Algorithms and Complexity

von EMJan 4th 2018

As usual, complex arguments explained in simple terms!\n\nSome problems are really tough! (e.g. there's a problem from Google Code Jam).\n\nThank you for this course!

von ASJun 15th 2018

Another great course in this specialization with challenging and interesting assignments. However, this one is somewhat harder but rewarding.

Dozenten

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics
Avatar

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

Über University of California San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

Über National Research University Higher School of Economics

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

Über die Spezialisierung Datenstrukturen und Algorithmen

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
Datenstrukturen und Algorithmen

Häufig gestellte Fragen

  • Sobald Sie sich für ein Zertifikat angemeldet haben, haben Sie Zugriff auf alle Videos, Quizspiele und Programmieraufgaben (falls zutreffend). Aufgaben, die von anderen Kursteilnehmern bewertet werden, können erst dann eingereicht und überprüft werden, wenn Ihr Unterricht begonnen hat. Wenn Sie sich den Kurs anschauen möchten, ohne ihn zu kaufen, können Sie womöglich auf bestimmte Aufgaben nicht zugreifen.

  • Wenn Sie sich für den Kurs anmelden, erhalten Sie Zugriff auf alle Kurse der Spezialisierung und Sie erhalten nach Abschluss aller Arbeiten ein Zertifikat. Ihr elektronisches Zertifikat wird zu Ihrer Seite „Errungenschaften“ hinzugefügt – von dort können Sie Ihr Zertifikat ausdrucken oder es zu Ihrem LinkedIn Profil hinzufügen. Wenn Sie nur lesen und den Inhalt des Kurses anzeigen möchten, können Sie kostenlos als Gast an dem Kurs teilnehmen.

Haben Sie weitere Fragen? Besuchen Sie das Hilfe-Center für Teiln..