Get updates on Eligibility, Admission, Placements Fees Structure
Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
If you have already learnt about the basics of Algorithms, you are now ready to take the next logical step into more complex algorithms and problem-solving. The idea behind this Advanced Algorithm and Complexity course is to teach you how to build upon the algorithm basics and utilize new ideas. In this course, we will be starting with network flows that are employed in the typical applications like detecting disjoint paths, optimal matching, and flight schedules along with a few other surprising applications like the segmentation of images in computer vision.
In the next segment, we teach linear programming with its application in allotting and optimizing budgets, Portfolio optimization, finding a diet that is cheap and satisfies all the requirements. Further, we discuss the inherent hard problems that have no perfectly good solutions known (and neither are likely to be found) and how you can solve them in practice. The course finishes with a slight introduction to the streaming of algorithms that are used, most heavily in Big Data Processing. These algorithms are mostly designed to process huge data sets without being capable of storing even a single dataset.
The Highlights
- Earn a Coursera certificate after course completion.
- 100% online offering
- Advanced level course.
- 27 hours of self-paced video learning
Programme Offerings
- assignments
- project work
- Shareable Certificates
- Self-Paced Learning Option
- Course Videos & Readings
- practice quizzes
Courses and Certificate Fees
| Certificate Availability | Certificate Providing Authority |
|---|---|
| yes | Coursera |
The fees for the course Advanced Algorithms and Complexity is -
| Head | Amount in INR |
| 1 month (20+ hours/week) | Rs. 6,757 |
| 3 month (16 hours/week) | Rs. 13,514 |
| 6 month (8 hours/week) | Rs. 20,271 |
Eligibility Criteria
Certification Qualifying Details
Candidates shall be awarded a shareable ‘Certificate of completion’ on duly completing the quizzes and assignments. Candidates will have to pass the graded quizzes to be able to complete the course and receive a certificate for completion of the Advanced algorithm and Complexity course. With the hands-on experience of working on two real-world projects, namely, the Big Networks and Genome Assembly candidates will get a true sense of how algorithms work in the industry.
What you will learn
After completing this course on Advance Algorithm and Complexity candidates can gain some important insights on-
- Working out complex hard problems and applying the correct algorithms and data structures in your everyday work.
- You will be able to solve the complex algorithm problems asked in technical interviews at Facebook, Google, Yandex, Microsoft, etc.
- For candidates belonging to the data science field, they can increase their experiment speed significantly.
- Advanced Algorithm writing and complex problem solving
- Learning network flow and its applications
- Introduction to streaming algorithms.
- Takeaways from practice quizzes and graded assignments to obtain a true learning experience
Who it is for
Admission Details
The Certificate course on Advanced Algorithm and Complexity admission procedure is very simple. Candidates can enrol in a matter of minutes and only need an email id and payment method to do so.
Please follow the following steps to register-
Step 1: Visit the Course Url and click on Enroll Now.
Step 2: Create an account or use Google or Facebook account to log in.
Step 3: You will be taken to the course page. Here, you can buy the course by clicking on enrolling.
You can also audit the course for free. However, you won’t receive a certificate in this mode.
Step 4: You can also choose a free 7-day trial to experience the premium version.
Step 5: For purchasing the course, enter your billing details and make the payment through various options available.
Step 6: You will instantly receive the course access for a published course and for courses that are not released yet you will receive a payment confirmation and more information on the course.
Step 7: After the course starts you can access all the video and study files at your own pace.
The Syllabus
Videos
- Introduction
- Network Flows
- Residual Networks
- Maxflow-Mincut
- The Ford–Fulkerson Algorithm
- Slow Example
- The Edmonds–Karp Algorithm
- Bipartite Matching
- Image Segmentation
Readings
- About University
- Slides and Resources on Flows in Networks
- Rules on the academic integrity in the course
- Available Programming Languages
- FAQ on Programming Assignments
Assignment
- Flow Algorithms
Programming Assignment
- Programming Assignment 1
Plugin
- Pre-survey on HSE online courses
Videos
- Introduction
- Linear Programming
- Linear Algebra: Method of Substitution
- Linear Algebra: Gaussian Elimination
- Convexity
- Duality
- (Optional) Duality Proofs
- Linear Programming Formulations
- The Simplex Algorithm
- (Optional) The Ellipsoid Algorithm
Reading
- Slides and Resources on Linear Programming
Assignment
- Linear Programming Quiz
Programming Assignment
- Programming Assignment 2
Videos
- Brute Force Search
- Search Problems
- Travelling Salesman Problem
- Hamiltonian Cycle Problem
- Longest Path Problem
- Integer Linear Programming Problem
- Independent Set Problem
- P and NP
- Reductions
- Showing NP-completeness
- Independent Set to Vertex Cover
- 3-SAT to Independent Set
- SAT to 3-SAT
- Circuit SAT to SAT
- All of NP to Circuit SAT
- Using SAT-solvers
Readings
- Slides and Resources on NP-complete Problems
- Minisat Installation Guide
Assignment
- NP-complete Problems
Programming Assignment
- Programming Assignment 3
Plugin
- Survey
Videos
- Introduction
- 2-SAT
- 2-SAT: Algorithm
- Independent Sets in Trees
- 3-SAT: Backtracking
- 3-SAT: Local Search
- TSP: Dynamic Programming
- TSP: Branch and Bound
- Vertex Cover
- Metric TSP
- TSP: Local Search
Reading
- Slides and Resources on Coping with NP-completeness
Assignment
- Coping with NP-completeness
Programming Assignment
- Programming Assignment 4
Videos
- Introduction
- Heavy Hitters Problem
- Reduction
- Reduction
- Basic Estimate
- Basic Estimate
- Final Algorithm
- Final Algorithm
- Proofs- I
- Proofs- II
Assignment
- Quiz: Heavy Hitters
Programming Assignment
- (Optional) Programming Assignment 5