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
Certification Course on Algorithms is a course crafted and taught by national award winner experts at IIT Bombay. The use of algorithms as a problem-solving tactic is a significant technical aspect which is important for candidates in the related domain. By pursuing this course, course takers will learn extensively about the structure and use of algorithms to confront real-life problems and explore limitless possibilities in the sector.
As a course separate from the regular classroom teaching, it does not miss out on covering relevant aspects including string, numerical, and geometric algorithms like matrix operations, polynomial multiplication, GCD, subsequences, pattern matching, sweep, and convex hull. Learners will also get insights on graph algorithms like spanning tree and shortest path. The course is primarily based on computer science which will create a drive among learners to think about algorithms and using sorting techniques like merge sort and quicksort.
The course encourages one-to-one participation as the faculty would primarily engage with discussing a problem, creating brainstorming sessions and initiating a discussion among the peers. The faculty also possesses vast practical and research experience in the field of algorithms and data structures for providing students with the best training.
The Highlights
- Fixed Time Course
- Eight hours of training each week
- Training and certification from IIT Bombay
- Exposure to real-life problem solving
- Certificate provided by IIT Bombay
Programme Offerings
- Lecture videos
- Reading Material
- Slides
- Graded Assignments
Courses and Certificate Fees
| Certificate Availability | Certificate Providing Authority |
|---|---|
| yes | IIT Bombay |
Eligibility Criteria
Education
Before pursuing Certification Course on Algorithms, learners will have to be apprised with the concepts of data structures as taught in other IIT Bombay courses- ‘Foundations of Data Structures’ and ‘Implementation of Data Structures
Certification Qualifying Details
IITBombayX Honor Code Certificates will be issued to participants after they complete the course successfully according to the grading policy provided in the course.
What you will learn
Certification Course on Algorithms would enlighten learners on the fundamentals of algorithms including median finding, searching algorithms and order statistics. By taking up this course, candidates will attain insights like-
- Learn to analyse algorithms based on its running time.
- Understanding the concept of big-oh.
- Know about divide and conquer approach to sorting and merge-sort the execution tree.
- Using prim’s algorithm for finding a spanning tree for a graph.
- Learn about naive string matching algorithms and their analysis.
- Learn about different computational geometry algorithms.
- Convex hull and its illustrations.
Who it is for
Certification Course on Algorithms can be pursued by the following individuals-
- Individuals enthusiastic about computer science
- Students who have previously studied data structures
- People seeking jobs in web companies
- Entrepreneurs or people working in startups
Admission Details
In order to register for Certification Course on Algorithms, learners will have to follow the given procedure-
Step 1: On the course link- https://archive.iitbombayx.in/courses/algorithms-4, sign up using your email id.
Step 2: A verification process will be initiated after which your account will be created on the portal.
Step 3: Login through the same course link with your verified account.
Step 4: Go to ‘Announcements’ section, select the name of the programme and register for it.
Step 5: You will receive an automated email after your registration is successful.
Step 6: To access the course content, go to IITBombayX site using the registered email id to access the course material.
The Syllabus
Learn to analyse algorithm based on its running time
Empirical Analyses of Running Time
Differentiating between Average and Worst Case Analysis
Learn about Asymptotic Analysis
Understanding the concept of Big-Oh
Learn about Comparison based Sorting
Learn about Selection, Insertion and Heap Sort of Abstract Data types for Sorting
Learn about Min-Heap Based Sort and its Array Representation
Know about Divide and Conquer Approach to Sorting and Merge-Sort Execution Tree
Learn about Quick-Sort Execution Tree and Worst case Running time of Quick-Sort
Introduction to Graph Traversal Algorithm – (BFS) – Its properties, analysis, and application.
Introduction to Graph Traversal Algorithm – (DFS) - Its properties, analysis, and application.
Know about Shortest Path in Weighted Graphs and Dijkstra’s Algorithm
Know about Shortest Path Algorithms – Bellman-Ford Algorithm
Introduction to All Pair Shortest Path Algorithm – Floyd-Warshal Algorithm and its examples
Using Prim’s Algorithm for finding a spanning tree for a graph
Introduction to Kruskal’s Algorithm and its analysis
Analysis of Prim’s Algorithm and Kruskal’s Algorithm
Learn about Bisection Method and its Advantages and Disadvantages
Introduction and Principles of Newton-Raphson Method
Introduction to String Matching Algorithm
Learn about Naive String Matching Algorithm and its Analysis
Introduction to Rabin-Karp Algorithm and its Analysis
Introduction to Finite Automaton Algorithm
Introduction to Knuth-Morris-Pratt Algorithm and its Analysis
Learn about different Computational Geometry Algorithms
Learn about properties of Line Segment
Introduction to Convex Hull and its illustrations