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 certificate programme on Algorithmic Toolbox by Coursera is an intermediate level course that will cover basic ideas for problems arising in the practical applications of computational problems, algorithmic techniques, greedy algorithms, Sorting and searching, Dynamic programming, and divide and conquer. The course offers a lot of theory and understanding of the burning questions in programming. It helps candidates develop an understanding of how to solve the most commonly arising problem and how they can break it into pieces and solve them recursively, Further how they can sort data and how it can help in searching, when it is ok to proceed greedily and how genomic studies use dynamic programming.
The candidates will be given enough practice in solving the computational problems, implement the solutions efficiently, design new algorithms, and ensure the easy and smooth running of the programs. This course forms a part of specialisation in Data structures and algorithm specialisation, for candidates willing to learn more about the topic and further continue to take the specialization too.
For candidates and professionals willing to learn about the new challenges in programming and better equip themselves for staying relevant in the industry this course on Algorithmic Toolbox will offer a much better understanding of the subject and help them take the next step in their career.
The Highlights
- Certificate on completion
- Shareable with your resume, LinkedIn profile, and portfolio.
- Flexible and 100% online
- Intermediate level learning
- Subtitles in multiple languages (Spanish And English)
- 40 hours of course content
Programme Offerings
- Graded Programming Assignments
- graded Quizzes with feedback
- video lectures
- peer feedback
- practice quizzes
Courses and Certificate Fees
| Certificate Availability | Certificate Providing Authority |
|---|---|
| yes | Coursera |
The Algorithmic Toolbox Fees details:
Particulars | Amount |
Course Fee, 1 Month | Rs. 6,757 |
Course Fee, 3 Month | Rs. 13,514 |
Course Fee, 6 Month | Rs. 20,271 |
Eligibility Criteria
Certification Qualifying Details
The certificate programme on Algorithmic Toolbox offers a certificate of completion to all the candidates who complete the course and submit all the graded assignments and quizzes and pass them satisfactorily.
What you will learn
By learning the Algorithmic Toolbox Course, candidates can expect to have an understanding of the following:
- Solving complex algorithmic problems by breaking it into pieces and solving them recursively.
- The use of algorithms and dynamic programming and its use in Genomic studies.
- Developers and Professionals can learn how to solve computational problems and design new solutions in order for easy and efficient running.
- Practical knowledge and experience along with and takeaways from all the various graded quizzes and programming assignments provided in the course of the programme duration.
Who it is for
The detailed Algorithmic Toolbox Course by Coursera is crafted for the following candidates:
- Professionals and developers working with dynamic programming for various industry applications.
- Developers working with software testing and debugging of programs. This course will help them understand the dynamics of computational programming and arising problems.
- Programmers who want to learn how to break a complex problem into pieces and solve it recursively.
Admission Details
The Certificate programme on Algorithmic Toolbox On Coursera can be enrolled for in a few simple steps. Candidates can register for this course in a matter of minutes.
Step 1: Visit the programme detail page on the Coursera website and click on ‘Enroll.’
Step 2: For those who already have an existing account on Coursera can simply log in, for others they can create a new account with their mail id, Facebook account, or Google account in order to log in to Coursera.
Step 3: In the next step, candidates can either buy the course by enrolling and then paying the fees for the course. Or they can opt for the auditing of the course for free. Candidates however should take note that the auditing option does not provide a certificate, they can just learn and access the video content on the course page.
Step 4: Optionally, candidates can also choose to take a free 7-day trial for the Coursera plus plan, which is their paid version for an experience of the course.
Step 5: Those candidates who are buying the course will have to enter the details for payment and pay the course fee by any of the chosen payment modes available.
Step 6: After paying the course fee or enrolling for the free audit course, candidates can have the access to all the course videos and relevant materials for reading.
Step 7: Candidates can then access/ download the videos and course material at their own pace, or reset deadlines in case they lose the momentum in between.
Step 8: This course is a part of a specialisation called Data Structures and Algorithms Specialisation and candidates can also choose to take up the entire specialisation after completing The Algorithmic Toolbox course.
The Syllabus
Videos
- Welcome!
- Solving the Sum of Two Digits Programming Challenge (screen cast)
- Solving the Maximum Pairwise Product Programming Challenge: Improving the Naive Solution, Testing, Debugging
- Stress Test - Implementation
- Stress Test - Find the Test and Debug
- Stress Test - More Testing, Submit and Pass!
Readings
- Ace Your Next Coding Interview
- What background knowledge is necessary?
- Optional Videos and Screencasts
- Alternative testing guide in Python
- Maximum Pairwise Product Programming Challenge
- Congratulations!
- Using PyCharm to solve programming challenges
- Acknowledgements
Assignment
- Solving Programming Challenges
Programming Assignments
- Programming Assignment 1: Sum of Two Digits
- Programming Assignment 1: Maximum Pairwise Product
Videos
- Asymptotic Notation
- Why study Algorithms?
- Big-O Notation
- Coming Up
- Naive Algorithm
- Problem Overview
- Efficient Algorithm
- Efficient Algorithm
- Problem Overview and Naive Algorithm
- Computing Runtimes
- Using Big-O
- Course Overview
Readings
- Resources
- Resources
- Resources
- Interview Questions
Assignments
- Logarithms
- Big-O
- Growth rate
Programming Assignment
- Programming Assignment 2: Algorithmic Warm-up
Ungraded Lab
- Big-O Notation: Plots
Readings
- Examples
- Local vs Global Optimum
- Proving Correctness of Greedy Algorithms
- Implementation
- Money Change
- Solution: Use the Largest Denomination First
- Proving Correcting
- Maximizing the Value of the Loot Problem
- Solution: Take as Much of the Most Expensive Compound as You Can
Assignments
- Largest Concatenate
- Money Change
- Puzzle: Car Fueling
- Puzzle: Balls in boxes
- Puzzle: Activity Selection
- Puzzle: Touch All Segments
Videos
- Largest Number
- Queue of Patients
- Implementation and Analysis
- Main Ingredients of Greedy Algorithms
- Celebration Party Problem
- Greedy Algorithm
- Implementation and Analysis
- Maximizing Loot
- Implementation and Analysis
- Review
Programming Assignment
- Programming Assignment 3: Greedy Algorithms
Videos
- Intro
- Linear Search
- Binary Search
- Binary Search Runtime
- Problem Overview and Naïve Solution
- Naïve Divide and Conquer Algorithm
- Faster Divide and Conquer Algorithm
- What is the Master Theorem?
- Proof of the Master Theorem
- Problem Overview
- Selection Sort
- Merge Sort
- Lower Bound for Comparison-Based Sorting
- Non-Comparison Based Sorting Algorithms
- Overview
- Algorithm
- Random Pivot
- Running Time Analysis (optional)
- Equal Elements
- Final Remarks
Readings
- Resources
- Resources
- Resources
- Resources
- Resources
Assignments
- Linear Search and Binary Search
- Puzzle: 21 questions game
- Puzzle: Two Adjacent Cells of Opposite Colors
- Polynomial Multiplication
- Master Theorem
- Sorting
- Quick Sort
- Puzzle: Local Maximum
Programming Assignment
- Programming Assignment 4: Divide and Conquer
Videos
- Change Problem
- The Alignment Game
- Computing Edit Distance
- Reconstructing an Optimal Alignment
Readings
- Resources
- Resources
Assignments
- Change Money
- Puzzle: Number of Paths
- Puzzle: Two Rocks Game
- Puzzle: Three Rocks Game
- Edit Distance
- Puzzle: Primitive Calculator
Programming Assignment
- Programming Assignment 5: Dynamic Programming 1
Videos
- Problem Overview
- Knapsack with Repetitions
- Knapsack without Repetitions
- Final Remarks
- Problem Overview
- Subproblems
- Algorithm
- Reconstructing a Solution
Readings
- Polynomial vs Pseudopolynomial
- Resources
Assignments
- Knapsack
- Maximum Value of an Arithmetic Expression
Programming Assignment
- Programming Assignment 6: Dynamic Programming 2