Informações sobre o curso
4.5
233 classificações
54 avaliações
Programa de cursos integrados
100% online

100% online

Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis

Prazos flexíveis

Redefinir os prazos de acordo com sua programação.
Nível avançado

Nível avançado

Horas para completar

Aprox. 26 horas para completar

Sugerido: 4 weeks of study, 4-8 hours/week...
Idiomas disponíveis

Inglês

Legendas: Inglês

Habilidades que você terá

Python ProgrammingLinear Programming (LP)Np-CompletenessDynamic Programming
Programa de cursos integrados
100% online

100% online

Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis

Prazos flexíveis

Redefinir os prazos de acordo com sua programação.
Nível avançado

Nível avançado

Horas para completar

Aprox. 26 horas para completar

Sugerido: 4 weeks of study, 4-8 hours/week...
Idiomas disponíveis

Inglês

Legendas: Inglês

Programa - O que você aprenderá com este curso

Semana
1
Horas para completar
5 horas para concluir

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....
Reading
9 vídeos (total de (Total 72 mín.) min), 3 leituras, 2 testes
Video9 videos
Network Flows9min
Residual Networks10min
Maxflow-Mincut7min
The Ford–Fulkerson Algorithm7min
Slow Example3min
The Edmonds–Karp Algorithm11min
Bipartite Matching11min
Image Segmentation7min
Reading3 leituras
Slides and Resources on Flows in Networks10min
Available Programming Languages10min
FAQ on Programming Assignments10min
Quiz1 exercício prático
Flow Algorithms10min
Semana
2
Horas para completar
5 horas para concluir

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....
Reading
10 vídeos (total de (Total 84 mín.) min), 1 leitura, 2 testes
Video10 videos
Linear Programming8min
Linear Algebra: Method of Substitution5min
Linear Algebra: Gaussian Elimination10min
Convexity9min
Duality12min
(Optional) Duality Proofs7min
Linear Programming Formulations8min
The Simplex Algorithm10min
(Optional) The Ellipsoid Algorithm6min
Reading1 leituras
Slides and Resources on Linear Programming10min
Quiz1 exercício prático
Linear Programming Quiz10min
Semana
3
Horas para completar
5 horas para concluir

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....
Reading
16 vídeos (total de (Total 115 mín.) min), 1 leitura, 2 testes
Video16 videos
Search Problems9min
Traveling Salesman Problem7min
Hamiltonian Cycle Problem8min
Longest Path Problem1min
Integer Linear Programming Problem3min
Independent Set Problem3min
P and NP4min
Reductions5min
Showing NP-completeness6min
Independent Set to Vertex Cover5min
3-SAT to Independent Set14min
SAT to 3-SAT7min
Circuit SAT to SAT12min
All of NP to Circuit SAT5min
Using SAT-solvers14min
Reading1 leituras
Slides and Resources on NP-complete Problems10min
Quiz1 exercício prático
NP-complete Problems12min
Semana
4
Horas para completar
5 horas para concluir

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. ...
Reading
11 vídeos (total de (Total 119 mín.) min), 1 leitura, 2 testes
Video11 videos
2-SAT10min
2-SAT: Algorithm12min
Independent Sets in Trees14min
3-SAT: Backtracking11min
3-SAT: Local Search12min
TSP: Dynamic Programming15min
TSP: Branch and Bound9min
Vertex Cover9min
Metric TSP12min
TSP: Local Search6min
Reading1 leituras
Slides and Resources on Coping with NP-completeness10min
Quiz1 exercício prático
Coping with NP-completeness6min
4.5
54 avaliaçõesChevron Right
Benefício de carreira

33%

consegui um benefício significativo de carreira com este curso
Promoção de carreira

50%

recebi um aumento ou promoção

Melhores avaliações

por 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!

por ASJun 15th 2018

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

Instrutores

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

Sobre 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....

Sobre 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 communications, IT, mathematics, engineering, and more. Learn more on www.hse.ru...

Sobre o Programa de cursos integrados Data Structures and Algorithms

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....
Data Structures and Algorithms

Perguntas Frequentes – FAQ

  • Ao se inscrever para um Certificado, você terá acesso a todos os vídeos, testes e tarefas de programação (se aplicável). Tarefas avaliadas pelos colegas apenas podem ser enviadas e avaliadas após o início da sessão. Caso escolha explorar o curso sem adquiri-lo, talvez você não consiga acessar certas tarefas.

  • Quando você se inscreve no curso, tem acesso a todos os cursos na Especialização e pode obter um certificado quando concluir o trabalho. Seu Certificado eletrônico será adicionado à sua página de Participações e você poderá imprimi-lo ou adicioná-lo ao seu perfil no LinkedIn. Se quiser apenas ler e assistir o conteúdo do curso, você poderá frequentá-lo como ouvinte sem custo.

Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.