algorithms

  1. Coursera

    Coursera Advanced Algorithms and Complexity

    Overview You'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 typical applications such as optimal...
  2. Coursera

    Coursera Genome Assembly Programming Challenge

    Overview In 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 mysterious bacterial strain that we...
  3. Coursera

    Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms

    Overview The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). Who is this...
  4. Coursera

    Coursera Graph Search, Shortest Paths, and Data Structures

    Overview The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from...
  5. Coursera

    Coursera Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

    Overview The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees). Who is this class for: Learners with at least a little bit of...
  6. Coursera

    Coursera Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

    Overview The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search)...
  7. edX

    edX Advanced Algorithmics and Graph Theory with Python

    Overview Algorithmics and programming are fundamental skills for engineering students, data scientists and analysts, computer hobbyists or developers. Learning how to program algorithms can be tedious if you aren’t given an opportunity to immediately practice what you learn. In this course, you...
  8. edX

    edX Algorithms

    Overview Algorithms power the biggest web companies and the most promising startups. Interviews at tech companies start with questions that probe for good algorithm thinking. In this computer science course, you will learn how to think about algorithms and create them using sorting techniques...
  9. edX

    edX Algorithm Design and Analysis

    Overview How do you optimally encode a text file? How do you find shortest paths in a map? How do you design a communication network? How do you route data in a network? What are the limits of efficient computation? This course, part of the Computer Science Essentials for Software Development...
  10. edX

    edX Algorithms and Data Structures in C#

    Overview When you create real-world applications, the ability to store information in your program code is critically important. In this course, you will learn how programming languages make use of various data structures to hold this information. For example, storing a list of values for...
  11. edX

    edX Algorithms and Data Structures

    Overview This course is part of the Microsoft Professional Program in Entry-Level Software Development. Want to build better programs? Learn how, in this professional-level course. Bring your programming experience, and join us for a deep dive into fundamental concepts that you can use right...
  12. edX

    edX Algorithmic Design and Techniques

    Overview In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn basic algorithmic techniques and ideas for computational problems, which arise in practical applications such as sorting and searching, divide and conquer, greedy algorithms and dynamic...
  13. edX

    edX Data Structures Fundamentals

    Overview 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, part of the Algorithms and Data Structures MicroMasters program, we consider the common data structures that are used in various...
  14. edX

    edX Graph Algorithms

    Overview If you have ever used a navigation service to find the 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, water and electricity supply networks, computer networks and, most...
  15. edX

    edX NP-Complete Problems

    Overview Step into the area of more complex problems and learn advanced algorithms to help solve them. This course, part of the Algorithms and Data Structures MicroMasters program, discusses inherently hard problems that you will come across in the real-world that do not have a known provably...
  16. edX

    edX String Processing and Pattern Matching Algorithms

    Overview The world and internet are full of textual information. We search for information using textual queries and read websites, books and e-mails. These are all strings from a computer science point of view. To make sense of all this information and make search efficient, search engines use...
  17. edX

    edX Dynamic Programming: Applications In Machine Learning and Genomics

    Overview If you look at two genes that serve the same purpose in two different species, how can you rigorously compare these genes in order to see how they have evolved away from each other? In the first part of the course, part of the Algorithms and Data Structures MicroMasters program, we...
  18. edX

    edX Graph Algorithms in Genome Sequencing

    Overview In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn how graph algorithms are used in two fundamental problems in modern biology: How do we sequence a genome? How do we construct an evolutionary “Tree of Life?" In the first part of the...
  19. MoocLab

    Algorithms, Part I

    COURSE DESCRIPTION This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and...
  20. MoocLab

    Algorithms, Part II

    COURSE DESCRIPTION This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and...
Top