CS-F364: DAA, Design and Analysis of Algorithms

CS-F364: Design and Analysis of Algorithms (Jan-Apr 2025)

Welcome to the course. I along with Dr. Abhishek Mishra (I/C) would be your instructor.

HOME

We would conduct this course in online mode this semester. See this place to find regular updates.

Lecture Sehedule: M W F 10:00PM-10:50PM
Course Handout: [pdf]
Chamber Consultation Hour (Dr. Kamlesh): 11:00 to 12:00 on Tuesdays
NALANDA LMS is here
Comprehensive Examination Date:

Lectures

Following lectures would be taken by Dr. Kamlesh. Dates, slide-handout and recorded lecture videos would be available as the course proceeds.

Course Handout: [pdf]
Lecture-6 (20 Jan 2025) [pdf] Greedy Algorithm, Activity Selection, Fractional Knapsack Problem
Lecture-7 (22 Jan 2025) [pdf] Huffman Algorithm
Lecture-8 (23 Jan 2025) [pdf] Matroids and Greedy method
Lecture-9 (27 Jan 2025) [pdf] Matroids Application - Mimimum Spanning Tree
Lecture-10 (29 Jan 2025) [pdf] Dynamic Programming - 0/1 Knapsack Problem

Tutorials

Tutorials would be conducted online.

Tutorial Sehedule: Thursday 8:00AM-8:50AM
Link to join Tutorials: [googleMeet]
There will be 12 tutorials. During the tutorial, a propbelm of tutorial sheet will randomly be selected and given for solving.
Four of them would be evaluated. (each having 8% weightage)
Student can decide which tutorials to evaluate.
You can choose One out of tutorials 1 to 3, one out of tutorials 4 to 6, one out of tutorials 7 to 9, and one out of tutorials 10 to 12

Tutorial Sheet 01: [pdf]
Tutorial Sheet 02: [pdf]
Tutorial Sheet 03: [pdf]
Tutorial Sheet 04: [pdf]
Tutorial Sheet 05: [pdf]
Tutorial Sheet 06: [pdf]