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.
Programa de cursos integrados Estruturas de dados e algoritmos
Master Algorithmic Programming Techniques. Learn algorithms through programming and advance your software engineering or data science career
Sobre este Programa de cursos integrados
O que você vai aprender
Apply basic algorithmic techniques such as greedy algorithms, binary search, sorting and dynamic programming to solve programming challenges.
Apply various data structures such as stack, queue, hash table, priority queue, binary search tree, graph and string to solve programming challenges.
Apply graph and string algorithms to solve real-world challenges: finding shortest paths on huge maps and assembling genomes from millions of pieces.
Solve complex programming challenges using advanced techniques: maximum flow, linear programming, approximate algorithms, SAT-solvers, streaming.
Habilidades que você terá
Certificados compartilháveis
Cursos 100% on-line
Cronograma flexível
Nível intermediário
Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.
Aprox. 6 meses para completar
Inglês
Como funciona o programa de cursos integrados
Fazer cursos
Um programa de cursos integrados do Coursera é uma série de cursos para ajudá-lo a dominar uma habilidade. Primeiramente, inscreva-se no programa de cursos integrados diretamente, ou avalie a lista de cursos e escolha por qual você gostaria de começar. Ao se inscrever em um curso que faz parte de um programa de cursos integrados, você é automaticamente inscrito em todo o programa de cursos integrados. É possível concluir apenas um curso — você pode pausar a sua aprendizagem ou cancelar a sua assinatura a qualquer momento. Visite o seu painel de aprendiz para controlar suas inscrições em cursos e progresso.
Projeto prático
Todos os programas de cursos integrados incluem um projeto prático. Você precisará completar com êxito o(s) projeto(s) para concluir o programa de cursos integrados e obter o seu certificado. Se o programa de cursos integrados incluir um curso separado para o projeto prático, você precisará completar todos os outros cursos antes de iniciá-lo.
Obtenha um certificado
Ao concluir todos os cursos e completar o projeto prático, você obterá um certificado que pode ser compartilhado com potenciais empregadores e com sua rede profissional.
Este Programa de cursos integrados contém 6 cursos
Algorithmic Toolbox
The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).
estrutura de dadosestrutura de dados
A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.
Algorithms on Graphs
If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect set of computers into a network or efficient algorithm to automatically find communities and opinion leaders in Facebook, you're going to work with graphs and algorithms on graphs.
Algoritmos em sequências de caracteres
World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Moreover, the emerging field of personalized medicine uses many search algorithms to find disease-causing mutations in the human genome.
Parceiros do setor
Sobre Universidade da Califórnia, San Diego
Sobre National Research University Higher School of Economics
Perguntas Frequentes – FAQ
Qual é a política de reembolso?
Posso me inscrever em um único curso?
Sim! Para começar, clique na carta de curso que lhe interessa e se inscreva. Você pode se inscrever e concluir o curso para ganhar um certificado compartilhável ou você pode auditar para ver os materiais do curso de graça. Quando você se inscrever em um curso que faz parte de uma especialização, você está automaticamente inscrito para a especialização completa. Visite o seu painel de aluno para acompanhar o seu progresso.
Existe algum auxílio financeiro disponível?
Posso fazer o curso gratuitamente?
Este curso é realmente 100% on-line? Eu preciso assistir alguma aula pessoalmente?
Este curso é totalmente on-line, então não existe necessidade de aparecer em uma sala de aula pessoalmente. Você pode acessar suas palestras, leituras e atribuições a qualquer hora e qualquer lugar, via web ou dispositivo móvel.
What will I be able to do upon completing the Specialization?
You will be able to apply the right algorithms and data structures in your day-to-day work and write programs that work in some cases many orders of magnitude faster. You'll be able to solve algorithmic problems like those used in the technical interviews at Google, Facebook, Microsoft, Yandex, etc. If you do data science, you'll be able to significantly increase the speed of some of your experiments. You'll also have a completed Capstone either in Bioinformatics or in the Shortest Paths in Road Networks and Social Networks that you can demonstrate to potential employers.
What background knowledge is necessary?
1. Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.
We expect you to be able to implement programs that: 1) read data from the standard input (in most cases, the input is a sequence of integers); 2) compute the result (in most cases, a few loops are enough for this); 3) print the result to the standard output. For each programming challenge in this course, we provide starter solutions in C++, Java, and Python. The best way to check whether your programming skills are enough to go through problems in this specialization is to solve two problems from the first week. If you are able to pass them (after reading our tutorials), then you will definitely be able to pass the course.
2. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.
Knowledge of discrete mathematics is necessary for analyzing algorithms (proving correctness, estimating running time) and for algorithmic thinking in general. If you want to refresh your discrete mathematics skills, we encourage you to go through our partner specialization — Introduction to Discrete Mathematics for Computer Science (https://www.coursera.org/specializations/discrete-mathematics). It teaches the basics of discrete mathematics in try-this-before-we-explain-everything approach: you will be solving many interactive puzzles that were carefully designed to allow you to invent many of the important ideas and concepts yoursel
What is the difference between this course and other courses covering algorithms?
We believe that learning the theory behind algorithms (like in most Algorithms 101 courses taught at 1000s universities) is important but not sufficient for a professional computer scientist today. This specialization combines the theory of algorithms with many programming challenges. In contrast with many Algorithms 101 courses, you will implement over 100 algorithmic problems in the programming language of your choice. And you will see yourself that the best way to understand an algorithm is to implement it!
Quanto tempo é necessário para concluir a Especialização?
Time to completion can vary based on your schedule, but most learners are able to complete the Specialization in 6-8 months.
Quantas vezes é oferecido cada curso na Especialização?
Each course in the Specialization is offered on a regular schedule, with sessions starting about once per month. If you don't complete a course on the first try, you can easily transfer to the next session, and your completed work and grades will carry over.
Do I need to take the courses in a specific order?
We recommend taking the courses in the order presented, as each subsequent course will build on material from previous courses.
Vou ganhar créditos universitários por concluir a Especialização?
Coursera courses and certificates don't carry university credit, though some universities may choose to accept Specialization Certificates for credit. Check with your institution to learn more.
Do I need to buy a textbook for this specialization?
The lectures in this specialization will be self-contained. Most lectures will be based on the bestselling textbook "Algorithms" co-authored by Sanjoy Dasgupta from University of California at San Diego as well as Christos Papadimitriou and Umesh Vazirani from University of California at Berkeley. In addition to UCSD and Berkeley, the textbook has been adopted in over 100 top universities and is available on Internet.
Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.
