[Coursera] Advanced Algorithms and Complexity

 

About this course: 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 matchings, finding disjoint paths and flight scheduling as well as more surprising ones like image segmentation in computer vision. We then proceed to linear programming with applications in optimizing budget allocation, portfolio optimization, finding the cheapest diet satisfying all requirements and many others. Next we discuss inherently hard problems for which no exact good solutions are known (and not likely to be found) and how to solve them in practice. We finish with a soft introduction to streaming algorithms that are heavily used in Big Data processing. Such algorithms are usually designed to be able to process huge datasets without being able even to store a dataset.

Who is this class for: Programmers with basic experience looking to understand the practical and conceptual underpinnings of algorithms, with the goal of becoming more effective software engineers. Computer science students and researchers as well as interdisciplinary students (studying electrical engineering, mathematics, bioinformatics, etc.) aiming to get more profound understanding of algorithms and hands-on experience implementing them and applying for real-world problems. Applicants who want to prepare for an interview in a high-tech company.

Created by:  University of California San Diego, National Research University Higher School of Economics
University of California San DiegoNational Research University Higher School of Economics
  • Alexander S. Kulikov

    Taught by:  Alexander S. Kulikov, Visiting Professor

    Department of Computer Science and Engineering
  • Michael Levin

    Taught by:  Michael Levin, Lecturer

    Computer Science
  • Daniel M Kane

    Taught by:  Daniel M Kane, Assistant Professor

    Department of Computer Science and Engineering / Department of Mathematics
  • Neil Rhodes

    Taught by:  Neil Rhodes, Adjunct Faculty

    Computer Science and Engineering
Basic Info
Course 5 of 6 in the Data Structures and Algorithms Specialization
Level Advanced
Commitment 4 weeks of study, 4-8 hours/week
Language
English
How To Pass Pass all graded assignments to complete the course.
User Ratings
4.5 stars
Average User Rating 4.5See what learners said

Size: 986.22M

 

 

2 Comments

  1. Joseph December 4, 2018 Reply
    • M December 5, 2018 Reply

Add a Comment

Your email address will not be published. Required fields are marked *