Daa Cif 2024
Daa Cif 2024
Learning Objective:
The objective of this course is to introduce the notion of algorithm, how to describe an algorithm
and model of computation for which an algorithm for a problem is to be designed. Time and space
complexities will be introduced to express the resource needed by an algorithm and to compare
different algorithms for a problem and to classify an algorithm as efficient or non-efficient.
Algorithm design paradigms such as Divide and Conquer, Greedy and Dynamic programming will
be introduced that will enable a student to apply one of the paradigms to design algorithm for a
given problem. The last part of the course will introduce the notion of NP-completeness to capture
the hardness of a problem and will show several fundamental problems in Computer Science and
engineering to be NP-complete.
Textbook References:
Text Book:
1. Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L. and Stein, Clifford. Introduction to
Algorithms. 4th Edition: The MIT Press, 2001.
Reference books:
1. Ellis Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran. Fundamental of Computer
Algorithm. 1st Edition: University Press, 2008.
2. Skiena Steven, S. The algorithm design manual, 2008
3. Kleinberg, J., & Tardos, É. Algorithm design. 1st Edition: Pearson Education India, 2006
Additional Resources:
1. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-
analysis-of-algorithms-spring-2015/
2. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-
to-algorithms-fall-2011/
3. https://nptel.ac.in/courses/106/106/106106131/
4. nptel.ac.in/courses/106/101/106101060/
Evaluation Method
Item Weightage (%)
Quizzes (2) 5+5 = 10
Midterm 25
Practical 25
Final Examination 40
*Please note, as per the existing institute’s attendance policy the student should have a minimum of 75%
attendance. Students who fail to attend a minimum of 75% lectures will be debarred from the End
Term/Final/Comprehensive examination.
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 3 3 3 2
CO2 1 1 3 1 3 3 3 3 2 2
CO3 3 3 3 1 3 3 3 3 2 2
CO4 3 3 3 3 3 3 3 3 3
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1 1 3 3 3
CO2 1 1 3 1 3 3 3
CO3 1 1 3 1 3 3 3
CO4 3 3 3 3 3 3
Updated By:
Approved By: