Information | Announcements | Mid-Sem Classes | End-Sem Classes | Assignments | References
| Course offered at | Instructors |
|---|---|
 Institute for Advancing Intelligence (IAI),
TCG Centres for Research and Education in Science and Technology (TCG Crest), Kolkata, India |
👤 Prof. Rana Barua ✉ 👤 Dr. Laltu Sardar ✉ 👤 Dr. Ritankar Mandal ✉ |
| ✦ Class Timing: Wednesday 2:30 pm - 4:00 pm & Friday; 11:30 am 1:00 pm |
| ✦ IAI Time-Table ✦ Syllabus ✦ IAI Complete Syllabus (old) |
| ✦ Marks Distribution: Mid-Sem: 40%, End-Sem: 40%, Project: 20% |
| ✦ Attendance: See your attendances here. |
| # | Mid-Sem | End-Sem | Assignments | Total |
|---|---|---|---|---|
| # | 40 | 40 | 20 | 100 |
| ✦ Old course-pages: 2021-22: Sem-I: Algorithms ; 2022-23: Sem-II: Algorithms |
| ☑ Assignment-II has been uploaded |
| ☑ Assignment-I has been uploaded |
| ☑ The classes will be start from January 17, 2024 |
| # | Date | Topic | Instructor | Remarks |
|---|---|---|---|---|
| 1 | 2024-Jan-17 | Complexity: Order Notation | Dr. Mandal | slides_day_01 |
| 2 | 2024-Jan-19 | Merge sort | Dr. Mandal | slides_day_02 |
| 3 | 2024-Jan-24 | Hash Table: Open Addressing and Chaining | Dr. Sardar | slides_day_03 |
| 4 | 2024-Jan-31 | Hash Table: Probing, Universal hashing | Dr. Sardar | slides_day_04 |
| 5 | 2024-Feb-02 | Mass Bunk ⚠ | Dr. Sardar | -- |
| 6 | 2024-Feb-07 | Heap Sort | Dr. Sardar |
slides_day_06
Source: MIT |
| 7 | 2024-Feb-09 | Divide and Conquer: Merge Sort | Dr. Mandal | slides_day_07 | -- | 2024-Feb-14 | Holiday | -- | -- | 8 | 2024-Feb-16 | Mass Bunk ⚠ | Dr. Mandal | -- |
| 9 | 2024-Feb-21 | Divide and Conquer: Finding Complexities | Dr. Mandal | slides_day_09 |
| 10 | 2024-Feb-23 | Divide and Conquer: Part -II | Dr. Mandal | slides_day_10 |
| 11 | 2024-Feb-28 | The maximum-subarray problem The Closest Pair Problem |
Dr. Sardar | slides_day_11 |
| 12 | 2024-Mar-01 | Dynamic Programming: Matrix Chain Multiplication |
Dr. Sardar | slides_day_12 |
| 13 | 2024-Mar-06 | Greedy: Interval Scheduling | Dr. Mandal | slides_day_13 |
| 14 | 2024-Mar-08 | Greedy: Job Scheduling |
Dr. Mandal | slides_day_14 |
| 15 | 2024-Mar-13 | Knapsack Problem | Dr. Mandal | slides_day_15 |
| 16 | 2024-Mar-15 | Comparing different algorithmic approaches, (Majority Problem) |
Dr. Sardar | slides_day_16 |
| ** | 2024-Feb-26 | Mid-semester Exam | -- | Question Paper |
| # | Date | Topic | Instructor | Remarks |
|---|---|---|---|---|
| 17 | 2024-Apr-17 | TBD | -- | slides_day_17 |
| 18 | 2024-Apr-19 | TBD | -- | slides_day_18 |
| 19 | 2024-Apr-24 | TBD | -- | slides_day_19 |
| 20 | 2024-Apr-26 | TBD | -- | slides_day_20 |
| 21 | 2024-May-01 | Holiday: May Day | -- | -- |
| 22 | 2024-May-03 | TBD | -- | slides_day_22 |
| 23 | 2024-May-08 | TBD | -- | slides_day_23 |
| 24 | 2024-May-10 | TBD | -- | slides_day_24 |
| 25 | 2024-May-15 | TBD | -- | slides_day_25 |
| 26 | 2024-May-17 | TBD | -- | slides_day_26 |
| 27 | 2024-May-22 | TBD | -- | slides_day_27 |
| 28 | 2024-May-24 | TBD | -- | slides_day_28 |
| 29 | 2024-May-27 | TBD | -- | slides_day_29 |
| 30 | 2024-May-29 | TBD | -- | slides_day_30 |
| 31 | 2024-May-31 | TBD | -- | slides_day_31 |
| 32 | 2024-Jun-05 | TBD | -- | slides_day_32 |
| 33 | 2024-Jun-07 | TBD | -- | slides_day_33 |
| 34 | 2024-Jun-12 | TBD | -- | slides_day_34 |
| 35 | 2024-Jun-14 | TBD | -- | slides_day_35 |
| -- | 2024-Jun-00 | End-semester Exam | -- | Question Paper |
| # | Topic | Project | Remarks | Deadline |
|---|---|---|---|---|
| 1 | Comparing Sorting Algorithms | Assignment-I | -- | Mar-10-2024 |
| 2 | Analyzing different types of Algorithms | Assignment-II | - | Mar-17-2024 |
| * | Submission |
Header should include: i. Name(s) of the Author(s) ii. Roll(s) iii. References |
Check fileName before submitiing |
Submission Link |
We will mainly follow [1] and [2].
T. H. Cormen, C. E. Leiserson and R. L. Rivest: Introduction to Algorithms, Prentice Hall of India, New Delhi, 1998.
S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani: Algorithms, McGraw Hill; New Delhi, ISBN: 978-9355325525
A. Aho, J. Hopcroft and J. Ullman: The Design and Analysis of Computer Algorithms, A. W. L, International Student Edition, Singapore, 19983.
E. Horowitz and S. Sahni: Fundamentals of Data Structures, CBS, New Delhi, 1977.
A. Aho, J. Hopcroft, and J. Ullman: Data Structures and Algorithms, Addison-Wesley, Reading, Mass., 1983.