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
Algorithms are an essential part of the computer to process data effectively. Algorithms are used as specifications for performing tasks like automated reasoning, calculation and even for data processing. Algorithms are becoming an important part of our lives even if we don’t notice it. To make a computer do whatever we desire it is important to write a programme for which algorithm plays an important role. With the help of which one can command the computer whatever they want to.
Whatever one thinks of making from a website to an app they need to create a programme in which programming plays a very important part. This course of Algorithms part II is specially designed for the candidate to upgrade their knowledge about algorithms after they have completed the part one course. It will help them to master their skills in programming and make them stand out from the competition that is prevailing in this era.
The Highlights
- Sixty-two hours course
- Full online learning
- Flexible deadlines
- Study along with English and Korean subtitles
- The course level is intermediate
- Enrol for free
Programme Offerings
- videos
- quizzes
- Readings
- lectures slides
Courses and Certificate Fees
| Certificate Availability |
|---|
| no |
Algorithms Part II Fees Structure
| Course | Amount |
| Algorithms Part II | Free |
What you will learn
- The candidates will learn about directed and undirected graphs
- They will learn the application of Kruskal's algorithm and Prim's algorithm.
Who it is for
This course is for the candidates who have completed the previous algorithm part I course.
Application Details
To enrol in the algorithm part II course the candidate has to follow the steps mentioned below:
Step 1: Go to the course page
Step 2: click on the ‘enrol for free’ option.
Step 3: fill in the required information to log in and proceed.
Step 4: Thereafter make the payment and get access to the course
The Syllabus
Videos
- Course Introduction
Readings
- Welcome to Algorithms, Part II
- Lecture Slides
Videos
- Introduction to Digraphs
- Digraph API
- Digraph Search
- Topological Sort
- Strong Components
Reading
- Lecture Slides
Quiz
- Interview Questions: Directed Graphs (ungraded)
Videos
- Introduction to Digraphs
- Digraph API
- Digraph Search
- Topological Sort
- Strong Components
Readings
- Lecture Slides
Quiz
- Interview Questions: Directed Graphs (ungraded)
Videos
- Introduction to MSTs
- Greedy Algorithm
- Edge-Weighted Graph API
- Kruskal's Algorithm
- Prim's Algorithm
- MST Context
Reading
- Overview
- Lecture Slides
Quiz
- Interview Questions: Minimum Spanning Trees (ungraded)
Videos
- Shortest Paths APIs
- Shortest Path Properties
- Dijkstra's Algorithm
- Edge-Weighted DAGs
- Negative Weights
Reading
- Lecture Slides
Quiz
- Interview Questions: Shortest Paths (ungraded)
Videos
- Introduction to Maxflow
- Ford–Fulkerson Algorithm
- Maxflow–Mincut Theorem
- Running Time Analysis
- Java Implementation
- Maxflow Applications
Reading
- Overview
- Lecture Slides
Quiz
- Interview Questions: Maximum Flow (ungraded)
Videos
- Strings in Java
- Key-Indexed Counting
- LSD Radix Sort
- MSD Radix Sort
- 3-way Radix Quicksort
- Suffix Arrays
Reading
- Lecture Slides
Quiz
- Interview Questions: Radix Sorts (ungraded)
Videos
- R-way Tries
- Ternary Search Tries
- Character-Based Operation
Reading
- Overview
- Lecture Slides
Quiz
- Interview Questions: Tries (ungraded)
Videos
- Introduction to Substring Search
- Brute-Force Substring Search
- Knuth–Morris–Pratt
- Boyer–Moore
- Rabin–Karp
Reading
- Lecture Slides
Quiz
- Interview Questions: Substring Search (ungraded)
Videos
- Regular Expressions
- REs and NFAs
- NFA Simulation
- NFA Construction
- Regular Expression Applications
Reading
- Overview
- Lecture Slides
Quiz
- Interview Questions: Regular Expressions (ungraded)
Videos
- Introduction to Data Compression
- Run-Length Coding
- Huffman Compression
- LZW Compression
Reading
- Lecture Slides
Quiz
- Interview Questions: Data Compression (ungraded)
Videos
- Introduction to Reductions
- Designing Algorithms
- Establishing Lower Bounds
- Classifying Problems
Reading
- Overview
- Lecture Slides
Quiz
- Interview Questions: Reductions (ungraded)
Videos
- Brewer's Problem
- Simplex Algorithm
- Simplex Implementations
- Linear Programming Reductions
Reading
- Lecture Slides
Quiz
- Interview Questions: Linear Programming (ungraded)
Videos
- Introduction to Intractability
- Search Problems
- P vs. NP
- Classifying Problems
- NP-Completeness
- Coping with Intractability
Reading
- Lecture Slides
Quiz
- Interview Questions: Intractability (ungraded)
Instructors
Princeton University, Princeton Frequently Asked Questions (FAQ's)
This course is approximately 62 hours but it entirely depends on the speed and grasping power of the candidate, how soon they can finish the course.
No, we do not promise any job opportunities after the candidate completes the course.
The course starts as soon as the candidate pays their enrolment fee. A notification for the same is sent on WhatsApp also.
There are no age limits for the candidate to enrol in the course.
To know the refund policy, click on the ‘Call Us’ button to connect with our enquiry desk.
The candidate must have a laptop and WIFI connection so that they can learn without interruption.
No, there is no certification provided after the completion of the course since it is free of cost.
The candidate can enrol for this part if they wish to. But we recommend them to complete Algorithm part I so that it becomes easy for them to understand part II.