The course on Algorithms is a foundational
importance in computer science and software engineering. Algorithms teaches to
break down complex problems into step-by-step procedures. Understanding
algorithms helps to choose the right method to solve a problem, helps to
improve speed and efficiency of software with better time and space complexity.
The course on Algorithms helps in improving competitive coding skills with better searching and sorting, dynamic programming and other foundational algorithmic paradigms. The course enhances the ability to think logically and critically, predict program behavior and optimize solutions under constraints. The conceptual understanding of Algorithms helps in understanding deeper subjects like Machine Learning, Data Science, Cryptography, Operating Systems. This is a course suitable for Undergraduate level students to strengthen their algorithmic basics and thereby enhance their programming and problem solving skills.
| Course Status : | Upcoming |
| Course Type : | |
| Language for course content : | English |
| Duration : | 12 weeks |
| Category : |
|
| Credit Points : | 4 |
| Level : | Diploma |
| Start Date : | 21 Jul 2025 |
| End Date : | 30 Nov 2025 |
| Enrollment Ends : | 31 Aug 2025 |
| Exam Date : | |
| Translation Languages : | English |
| NCrF Level : | 4.5 |
| Industry Details : | Teaching |
|
swayam@nitttrc.edu.in, swayam@nitttrc.ac.in
Module
1: Fundamentals of Algorithms and Analysis (Week 1–3)
• Definition
of algorithm
• Importance
of algorithms in problem solving
• Characteristics
of good algorithms
• Data
Abstraction
• Stacks
and Queues
• Time
and space complexity
• Asymptotic
notations (Big O, Omega, Theta)
Module
2: Sorting Algorithms (Week 4-5)
• Bubble
Sort, Selection Sort
• Insertion
Sort, Merge Sort, Quick Sort
• Comparison
of sorting techniques (Time and space trade-offs)
Module
3: Searching Algorithms (Week 6–7)
• Linear
Search
• Binary
Search
• Binary
Search Trees
• Balanced
Search Trees
• Hash
Tables
• Comparison
of sorting techniques (Time and space trade-offs)
Module
4: Graphs (Week 8-9)
• Directed
and Undirected Graphs
• Paths,
Cycles, spanning Trees, Directed Acyclic Graphs
• Topological
Sorting
Module
5: Graph Algorithms (Week 10-13)
• Graph
representation (adjacency list/matrix)
• BFS
and DFS traversal
• Connected
components
• Applications
of graph traversal
Module
6: Strings (Week 14 - 16)
• String
Sort
• Tries
• Substring
Search
• Regular
Expressions
• Elementary
Data Compression
1.
Algorithms
By Robert Sedgewick and Kevin Wayne
2.
Introduction to
Algorithms
By Thomas H. Cormen, Charles E.
Leiserson, Ronald L. Rivest, and Clifford Stein (CLRS)
3. Design and Analysis of Algorithms
By S. S. Srivastava & U. P. Pandey
(Khanna Publishing)
4. Fundamentals of Computer Algorithms
By Ellis Horowitz, Sartaj Sahni, and S.
Rajasekaran
5. Data Structures and Algorithm Analysis in C /
C++ / Java
By Mark Allen Weiss
Dr. Narendran Rajagopalan is currently serving as Associate Professor in the Department of Computer Science and Engineering, NIT Puducherry. He holds a Ph.D in Computer Science and Engineering from NIT Trichy. With more than 15 years of teaching and research experience, his areas of specialization include Algorithms, Data Structures, Networks and Security. He has more than 75 research publications to his credit. He has guided 5 Ph.Ds with 5 more currently pursuing under his guideship. He is working on developing several smart and efficient software solutions to ease day-to-day problems in collaboration with Indian and International funding partners. Prior to his academic pursuits, he worked with eminent IT firms like Unisys Global Services, NXP Semiconductors and Emerson Network Power.
Dr.Narendran is passionate about the Algorithms course as he believes that Algorithmic aptitude forms the basis for computer programming - cementing the reason why he has handled this core subject both at the under-graduate and post-graduate level at NIT Puducherry for over a decade now.
"The SWAYAM Course Enrolment and learning is free. However, to obtain a certificate, the learner must register and take the proctored exam in person at one of the designated exam centres. The registration URL will be announced by NTA once the registration form becomes available. To receive the certification, you need to complete the online registration form and pay the examination fee. Additional details, including any updates, will be provided upon the publication of the exam registration form. For more information about the exam locations and the terms associated with completing the form, please refer to the form itself."
Grading Policy:
- Internal Assignment Score: This accounts for 30% of the final grade and is calculated based on the average of the best three assignments out of all the assignments given in the course.
- Final Proctored Exam Score: This makes up 70% of the final grade and is derived from the proctored exam score out of 100.
- Final Score: The final score is the sum of the average assignment score and the exam score.
Eligibility for Certification:
- To qualify for a certificate, you must achieve an average assignment score of at least 10 out of 30, and an exam score of at least 30 out of 70. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >=40/100.
Certificate Details:
- The certificate will include your name, photograph, roll number, and the percentage score from the final exam. It will also feature the logos of the Ministry of Education, SWAYAM, and NITTTR.
- Certificate Format: Only electronic certificates (e-certificates) will be issued; hard copies will not be dispatched.
Once again, thanks for your interest in our online courses and certification. Happy Learning.
*********
DOWNLOAD APP
FOLLOW US