Data Structure and Algorithms using Java

Week by week (official course layout)

1. Week 1: 1D array, list and vector, 2D matrices and tables of objects
2. Week 2: Java implementation of 1D and 2D arrays and its operations
3. Week 3: Linked lists and its various operations, stack and queue
4. Week 4: Java implementation of linked lists, stack and queue
5. Week 5: Binary trees: Representation and operations. Variations of binary tree: Binary search tree, Height balanced search tree, Heap tree
6. Week 6: Java implementation of binary trees and its variations
7. Week 7: Graph : Structure, representation and operations
8. Week 8: Java implementations of graph data structures
9. Week 9: Algorithms (Part-I): Searching and sorting algorithms
10. Week 10: Java implementation of Part-I algorithms
11. Week 11: Algorithms (Part-II): Greedy algorithms, shortest path algorithms
12. Week 12: Java implementation of Part-II algorithms

Topics as the course page lists them. Weekly assignment due dates are shown only inside the course after a SWAYAM sign-in, so they are not here — check the course page every week.

This course's certificate rule

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course. Exam score = 75% of the proctored certification exam score out of 100 Final score = Average assignment score + Exam score Please note that assignments encompass all types (including quizzes, programming tasks, and essay submissions) available in the specific week. YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

As printed on the course page. General rules: NPTEL FAQ.