Careers360 Logo
Interested in this College?
Get updates on Eligibility, Admission, Placements Fees Structure
Compare

Quick Facts

Medium Of InstructionsMode Of LearningMode Of Delivery
EnglishSelf StudyVideo 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 AvailabilityCertificate Providing Authority
yesCoursera

Fee details for Advanced Algorithms and Complexity Programe

Course

Fees in INR

1 Month

 Rs. 6,451 (plus GST)

3 Months

Rs. 12,903 (plus GST)

6 Months

Rs. 19,354 (plus GST)


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

Programming skillsKnowledge of AlgorithmsKnowledge of Python

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
Practice exercise
  • Flow Algorithms

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
Practice exercise
  • Linear Programming Quiz

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
Practice exercise
  • NP-complete Problems

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
Practice exercise
  • Coping with NP-completeness

Videos
  • Introduction
  • Heavy Hitters Problem
  • Reduction
  • Reduction
  • Basic Estimate
  • Basic Estimate
  • Final Algorithm
  • Final Algorithm
  • Proofs- I
  • Proofs- II
Practice exercise
  • Quiz: Heavy Hitters

Instructors

UC San Diego Frequently Asked Questions (FAQ's)

1: What is the advantage of taking this course from Coursera?

Coursera courses are taught by some of the best instructors of the leading universities in the world. They are subject matter experts in their fields and offer solutions and insights that you make take time to learn on your own.

2: What can be done if candidates cannot understand a topic after a session?

Coursera has a student discussion forum where you can post your queries 24x7. Forums are a great way to discuss and clarify your doubts with peers who are attending the same course.

3: Is the course completely online, or I need to attend classes?

The course is 100% online. You can attend the class from anywhere and at any time you deem correct. The course is self-paced and you can watch as much or as little as you wish on any given day.

4: Do I need to take the course in the particular given order?

Yes. We recommend you take the course in the given order to have a better understanding of concepts that may be built upon from previous lectures. So it is implicit, you know the previous information provided in starting lectures.

5: How long will it take for me to complete this course?

This depends on your own pace. On average learners can complete this course in one to two months. And about six to eight months for the complete specialization.

Articles

Download Careers360 App's

Regular exam updates, QnA, Predictors, College Applications & E-books now on your Mobile

  • student
    250M+

    Students

  • colleges
    30,000+

    Colleges

  • exams
    500+

    Exams

  • ebook
    1500+

    E-Books

  • certification
    12000+

    Cetifications

student
Mobile Screen

We Appeared in

Back to top