DAA Notes
DAA Notes
DAA Notes
To become renowned centre of excellence in Computer Science and Engineering and make
competent engineers & professionals with high ethical values prepared for lifelong learning.
Mission 1: To impart outcome based education for emerging technologies in the field of
Computer Science and Engineering.
Mission 3: To provide platform for lifelong learning by accepting the change in technologies.
PEO1: To provide students with the fundamentals of engineering sciences with more
emphasis in Computer Science and Engineering by way of analyzing and exploiting
engineering challenges.
PSO1. Ability to interpret and analyze network specific and cyber security issues, automation
in real word environment.
PSO2. Ability to Design and Develop Mobile and Web-based applications under realistic
constraints.
CO3 Implement various divide and conquer,greedy and dynamics statergies based algorithms
Classify the algorithms and problems in various categories like NP, NP-Hard & NP-
CO4
Complete
Mapping Between CO and PO:
Pos
1 2 3 4 5 6 7 8 9 10 11 12
Cos
3 3 2 2 1 1 1 1 1 2 1 3
1
3 3 3 2 1 1 1 2 1 1 2 3
2
3 3 2 2 1 1 1 1 1 1 1 3
3
3 3 3 3 2 1 1 1 1 2 1 3
4
1 2 2
2 2 2
3 1 2
4 2 2
RTU Syllabus of Analysis of Algorithms (5CS4-05)
Lecture Plan of Analysis of Algorithms (5CS4-05)
Lect.
Units Topics
Req.
Objective Scope and Outcome of the subject 1
1
KMP Matcher
1
Boyer Moore Algorithms
1
Network capacity assignment problems
PROBLEM CLASSES NP, NP-HARD AND NP-COMPLETE: Definitions of P, NP Hard and
NP-Complete Problems 3
Decision Problems
Unit-5
(8) Cook's Theorem
3
Proving NP Complete Problems - Satisfiability problem and Vertex Cover Problem
Approximation Algorithms for Vertex Cover and Set Cover Problem 2
Recommended books:
1. Rivest & Coremen, Introduction to Algorithms, II Edition, Prentice Hall of India
2. Sartaj Sahni and Ellis Horowitz, Fundamentals of Computer Algorithms, Edition 2006, Galgotia
Publications
Complexity Analysis
• There are often many different algorithms which can be used to solve the same problem.
Thus, it makes sense to develop techniques that allow us to:
• We are usually interested in the worst case complexity: what are the most operations
that might be performed for a given problem size. We will not discuss the other cases --
best and average case
o Easier to compute