Spécialisation Data Structures and Algorithms
Master Algorithmic Programming Techniques. Learn algorithms through programming and advance your software engineering or data science career
À propos de cette Spécialisation
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.
Créé par :
Partenaires du secteur :
Suivez l'ordre suggéré ou choisissez le vôtre.
Conçu pour vous aider à vous exercer et à appliquer les compétences que vous avez acquises.
Mettez en évidence vos nouvelles compétences sur votre CV ou sur LinkedIn.
- Intermediate Specialization.
- Some related experience required.
Algorithmic ToolboxSession en cours : May 21
- 5 weeks of study, 4-8 hours/week
- English, Spanish
À propos du coursThe 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
Data StructuresSession en cours : May 21
- 4 weeks of study, 5-10 hours/week
À propos du coursA 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 wi
Algorithms on GraphsSession en cours : May 21
- 5 weeks of study, 3-4 hours/week
À propos du coursIf 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
Algorithms on StringsSession en cours : May 21
- 4 weeks of study, 4-8 hours/week
À propos du coursWorld 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 mak
Advanced Algorithms and ComplexitySession en cours : May 21
- 4 weeks of study, 4-8 hours/week
À propos du coursYou've learned the basic algorithms now and are ready to step into the area of more complex problems and algorithms to solve them. Advanced algorithms build upon basic ones and use new ideas. We will start with networks flows which are used in more
Genome Assembly Programming ChallengeSession à venir : May 28
À propos du coursIn Spring 2011, thousands of people in Germany were hospitalized with a deadly disease that started as food poisoning with bloody diarrhea and often led to kidney failure. It was the beginning of the deadliest outbreak in recent history, caused by a my
Daniel M Kane
Alexander S. Kulikov
More questions? Visit the Learner Help Center.