CS-F364: DAA, Design and Analysis of Algorithms

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 3:00PM-3:50PM
Compensatory Class: on Sunday 11AM, Feb 07, 2021
Link to join live lecture sessions: [googleMeet]
Link to join Tutorials: [googleMeet]
Course Handout: [pdf]
Chamber Consultation Hour (Dr. Kamlesh): 11:00 to 12:00 on Tuesdays [googleMeet]
NALANDA LMS is here
Comprehensive Examination Date: Saturday 22/05/2021 9:00AM-11:00AM

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-1 (18 Jan 2021) [pdf] [video] Introduction, Asymptotic Notations, Analysis of Insertion sort and Merge Sort.
Lecture-2 (20 Jan 2021) [pdf] [video] Asymptotic Notation, Recurrence Relation, Master method, Karatsuba's Multiplication Algorithm.
Lecture-3 (22 Jan 2021) [pdf] [video] Sorting - quick, lower bound, linear time. Defective Chessboard Problem.
Lecture-4 (25 Jan 2021) [pdf] [video] Strassen's Matrix Multiplication Algorithm, Polynomial Representations, Evaluating a Polynomial using Horners' Rule, Interpolation using Gaussian Elimination.
Lecture-5 (27 Jan 2021) [pdf] [video] Discrete Fourier Transform. Fast Fourier Transform Algorithm.
Lecture-6 (29 Jan 2021) [pdf] [video] Greedy Algorithm, Activity Selection, Fractional Knapsack Problem
Lecture-7 (03 Feb 2021) [pdf] [video] Huffman Encoding, Optimality of Huffman Encoding
Lecture-8 (05 Feb 2021) [pdf] [video] Matroids.
Lecture-9 (07 Feb 2021) [pdf] [video] Application of Matroids, Minimum Spanning Tree.
Lecture-10 (08 Feb 2021) [pdf] [video] Dynamic Programming, 0/1 Knapsack Problem.
Lecture-11 (10 Feb 2021) [pdf] [video] The Traveling Salesman Problem (TSP).
Lecture-12 (12 Feb 2021) [pdf] [video] Matrix Chain Multiplication.
Lecture-13 (15 Feb 2021) [pdf] [video] Longest Common Subsequence.
Lecture-14 (17 Feb 2021) [pdf] [video] Optimal Binary Search Trees.
Lecture-15 (19 Feb 2021) [pdf] [video] Flow Shop Scheduling.
Lecture-16 (22 Feb 2021) [pdf] [video] The Maximum Flow Problem and the Ford-Fulkerson Algorithm.
Lecture-17 (08 Mar 2021) [pdf] [video] Maximum Flows and Minimum Cuts in a Network.
Lecture-18 (10 Mar 2021) [pdf] [video] The Bipartite Matching Problem.
Lecture-19 (12 Mar 2021) [pdf] [video] Disjoint Paths in Directed and Undirected Graphs.
Lecture-20

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]

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

HOME

Lectures

Tutorials