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
Design and Analysis of Algorithms program is an undergraduate course in the field of Foundation of computing and Computer Science and Engineering. It is a free MOOC that will be held on the online learning platform Swayam. Swayam is a learning portal and an initiative by the Ministry of Education, Government of India.
The syllabus of the Design and Analysis of Algorithms certification has been designed by Chennai Mathematical Institute in association with NPTEL. The program will be taught by professor Madhavan Mukund, the Dean of Studies at Chennai Mathematical Institute. Along with video lectures, candidates will have assignments and a list of books and references to understand the course contents better.
During the Design and Analysis of Algorithms training, candidates will explore various topics such as Intractability, Design techniques, asymptotic complexity, data structures, algorithm on graphs, sorting, and searching. The course also offers a certification for interested eligible candidates. However, certification is granted only if students pass the final test.
The Highlights
- List of books and references
- Expert faculty from Chennai Mathematical Institute
- Online elective undergraduate course
- Foundations of Computing and Computer Science and Engineering category
- Eight-week course
- E-certification availability
- AICTE approved FDP course on Swayam
- Result of an association of NPTEL and Chennai Mathematical Institute
- MCQs, Fill in the blanks, and programming assignments
- End-of-Term offline proctored exam
Programme Offerings
- NPTEL and Chennai Mathematical Institute course
- Online elective undergraduate course
- MCQs
- Programming Assignments
- List of books and references
- End-of-Term test
- Offline proctored exam
- Expert Faculty
- e-certification availability
Courses and Certificate Fees
| Fees Informations | Certificate Availability | Certificate Providing Authority |
|---|---|---|
| INR 1000 | yes | CMI Chennai |
- Candidates do not have to pay an enrollment or joining fee for Design and Analysis of Algorithms training. The exam fee of Rs. 1,000 should only be paid by candidates who want to appear for the final exam.
Design and Analysis of Algorithms program fee structure
Course Name | Fee |
Design and Analysis of Algorithms (Exam fee) | Rs. 1,000. |
Eligibility Criteria
Candidates who want to join the Design and Analysis of Algorithms program are encouraged to go through an introductory course on data structures and programming.
Certificate Qualifying Details
Besides, to qualify for a certificate, participants need to submit all the assignments, appear for an end-of-term exam and score a minimum of 40 marks in the final score. After submitting the assignments, the best six out of the eight assignments will be considered by calculating the assignment score. The minimum qualifying assignment score is 10/25. In the end-of-term exam, candidates must achieve a minimum of 30/75. Only participants who complete all these eligibility criteria will be awarded the certification.
What you will learn
Participants who complete the Design and Analysis of Algorithms program will gain knowledge about the topics given below:
- Intractability
- Asymptotic complexity and O() notation
- Search trees, heaps, and union of disjoint sets in data structures
- Search and Sorting
- Greedy, dynamic programming, and divide and conquer in design techniques
- Algorithms of graphs such as shortest paths, spanning trees, connectivity, exploration, and directed acyclic graphs
Who it is for
Design and Analysis of Algorithms online training is recommended for the second-year and third-year engineering students studying computer science.
Admission Details
- To enrol in the Design and Analysis of Algorithms online course, visit the Swayam platform at https://swayam.gov.in/ and run a search for “Design and Analysis of Algorithms” in the search catalog.
- If the course is available in the ‘Upcoming(Enrollment Open)’, tap on course to join
- You will be redirected to a sign-up/sign-in form. Fill in the details and create an account or sign-in.
- Fill in the details in the online application form and make the exam fee payment, if required.
Application Details
To access the Design and Analysis of Algorithms program’s online form, participants have to create an account or log in on the Swayam platform. To sign up, they can use an email address, choose their username and password or sign in using their Facebook, Google, or Microsoft account.
The Syllabus
- Introduction
- Examples and motivation
- Examples and motivation
- Asymptotic complexity: informal concepts
- Asymptotic complexity: formal notation
- Asymptotic complexity: examples
- Assignments MCQ/Fill in blanks (unique answer)
- Assignments MCQ/Fill in blanks (unique answer)
- Searching in list: binary search
- Sorting: insertion sort
- Sorting: selection sort
- Sorting: merge sort
- Sorting: quicksort
- Sorting: stability and other issues
- Assignments MCQ/Fill in blanks, programming assignment
- Graphs: Motivation
- Graph exploration: BFS
- Graph exploration: DFS
- DFS numbering and applications
- Directed acyclic graphs
- Directed acyclic graphs
- Assignments MCQ/Fill in blanks, programming assignment
- Shortest paths: unweighted and weighted
- Single source shortest paths: Dijkstra
- Single source shortest paths: Dijkstra
- Minimum cost spanning trees: Prim’s algorithm
- Minimum cost spanning trees: Kruskal’s Algorithm
- Union-Find data structure
- Assignments MCQ/Fill in blanks, programming assignment
- Divide and conquer: counting inversions
- Divide and conquer: nearest pair of points
- Priority queues, heaps
- Priority queues, heaps
- Dijstra/Prims revisited using heaps
- Search Trees: Introduction
- Assignments MCQ/Fill in blanks, programming assignment
- Search Trees: Traversals, insertions, deletions
- Search Trees: Balancing
- Greedy : Interval scheduling
- Greedy : Proof strategies
- Greedy : Huffman coding
- Dynamic Programming: weighted interval scheduling
- Assignments MCQ/Fill in blanks, programming assignment
- Dynamic Programming: memorization
- Dynamic Programming: edit distance
- Dynamic Programming: longest ascending subsequence
- Dynamic Programming: matrix multiplication
- Dynamic Programming: shortest paths: Bellman Ford
- Dynamic Programming: shortest paths: Floyd Warshall
- Assignments MCQ/Fill in blanks, programming assignment
- Intractability: NP completeness
- Intractability: reductions
- Intractability: examples
- Intractability: more examples
- Misc topics
- Misc topics
- Assignments MCQ/Fill in blanks
Evaluation process
Participants of the Design and Analysis of Algorithms training interested in qualifying for certification need to appear for an offline proctored examination. This end-of-term exam will be held in designated exam centers. The exam date, exam center details, and any related information will be given to the participants in advance. Candidates need to pay an exam fee and score the minimum passing marks in the certificate qualification exam.
Instructors
CMI Chennai Frequently Asked Questions (FAQ's)
Individuals can join the Design and Analysis of Algorithms on the Swayam learning platform.
Yes, there is no enrolment fee, but there is an exam fee for participants who want to obtain a certificate.
Yes. Design and Analysis of Algorithms is a 100% digital free-to-audit course.
No, only e-certificates are available.
The certificate can be verified at https://nptel.ac.in/noc/