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
The Analysis of Algorithms online course familiarises students with calculating the computational complexity of algorithms. The training also covers function generation, recurrences, telescoping, and more concepts related to the scientific study of algorithm performance. Candidates learn about real asymptotics, symbolic methods, and basic structures like words, permutations, strings, trees, and mappings, through the programme.
The Coursera Analysis of Algorithms programme is 100% online and free course. It consists of pre-recorded video lectures, pop quizzes, readings, assignments, and practical exercises across a nine-week curriculum. Robert Sedgewick, who is currently the William O. Baker Professor of Computer Science at Princeton, will be your instructor.
The Online Analysis of Algorithms training course is an advanced-level programme offered in collaboration with Princeton University. Candidates will need approximately 20 hours to finish this course. Besides, you will get English subtitles for the video lectures and flexible deadlines to learn at ease. Since this is free training; candidates will not receive a certification.
The Highlights
- Self-paced education
- Princeton University offering
- 100% Online
- Readings for every module
- Advanced level training
- Practice Exercises
- Flexible deadlines
- English subtitles
- Pop Quizzes
- Approx. 20 hours to complete
- Practice exercises
- Free course
Programme Offerings
- Practice Exercises
- Flexible Deadlines
- video transcript
- pre recorded video lectures
- 100% online course
- English Subtitles
- Self paced learning
- Princeton University Offering
Courses and Certificate Fees
| Certificate Availability |
|---|
| no |
What you will learn
After completing the Analysis of Algorithms course by Coursera, you will become adept in the following skills:
- Understanding history and motivation of algorithm performance
- Ability to identify and work with recurrence relations, merge sort algorithm, and master theorem
- Expertise in generating functions and counting binary trees with N nodes
- Familiarity with asymptotics and analytic combinatorics
- Learning about mapping, strings, tries, words, trees, and permutations
Who it is for
Admission Details
Candidates who wish to enrol in the Analysis of Algorithms training course can do so for free.
- Visit the Course page.
- Find the “Analysis of Algorithms” course, using the search bar.
- Click on the“Join for Free” option that is at the top right corner of the page.
- If you have an account on Coursera, log in and enrol for the course. Those who do not have an account, login using Google, Facebook, or Apple ID.
Application Details
Candidates are not required to submit a separate application form for enrolling in the Analysis of Algorithms training programme. They just have to sign up with a Google or Coursera account and enrol in the programme to get learning material for free.
If candidates sign up using their email address, they need to provide their name and create a password as well. Once the enrollment is successful, they can access the course content instantly.
The Syllabus
Videos
- History and Motivation
- A Scientific Approach
- Example: Quicksort
- Resources
Readings
- Getting Started
- Exercises from Lecture 1
Assignment
- Analysis of Algorithms
Discussion Prompt
- Exercises from Lecture 1
Videos
- Computing Values
- Telescoping
- Types of Recurrences
- Mergesort
- Master Theorem
Reading
- Exercises from Lecture 2
Assignment
- Recurrences
- Pop Quiz on Telescoping
- Pop Quiz on the Master Theorem
Discussion Prompt
- Exercises from Lecture 2
Videos
- Ordinary Generating Functions
- Counting with Generating Functions
- Catalan Numbers
- Solving Recurrences
- Exponential Generating Functions
Reading
- Exercises from Lecture 3
Assignment
- Generating Functions
Discussion Prompt
- Exercises from Lecture 3
Videos
- Standard Scale
- Manipulating Expansions
- Asymptotics of Finite Sums
- Bivariate Asymptotics
Reading
- Exercises from Lecture 4
Assignment
- Asymptotics
Discussion Prompt
- Exercises from Lecture 4
Videos
- The Symbolic Method
- Labelled Objects
- Coefficient Asymptotics
- Perspective
Readings
- Errata
- Exercises from Lecture 5
Assignment
- Analytic Combinatorics
Discussion Prompt
- Exercises from Lecture 5
Videos
- Trees and Forests
- Binary Search Trees
- Path Length
- Other Types of Trees
Reading
- Exercises from Lecture 6
Assignment
- Trees
Discussion Prompt
- Exercises from Lecture 6
Videos
- Basics
- Sets of Cycles
- Left-Right-Minima
- Other Parameters
- BGFs and Distributions
Reading
- Exercises from Lecture 7
Assignment
- Permutations
Discussion Prompt
- Exercises from Lecture 7
Videos
- Bitstrings with Restrictions
- Languages
- Tries
- Trie Parameters
- Exercises
Reading
- Exercises from Lecture 8
Assignment
- Strings and Tries
Discussion Prompt
- Exercises from Lecture 8
Videos
- Words
- Birthday Problem
- Coupon Collector Problem
- Hash Tables
- Mappings
- Exercises
Reading
- Exercises from Lecture 9
Assignment
- Strings and Words
Discussion Prompt
- Exercises from Lecture 9