DAA Lesson Plan
DAA Lesson Plan
LESSON PLAN
Name of the Faculty Member Subject code Subject name Class & Branch Department With effect from Last working Day Allocated Periods : D.ANIL KUMAR : : DESIGN AND ANALYSIS OF ALGORITHMS : 3-1/4 B.Tech CSE : CSE : 13/06/2011 : : 6 per week
UNIT-I
Introduction:
S.NO
1.1 1.2 1.3 1.4
Concept
Algorithm,Psuedo code for expressing algorithms Performance Analysis-Space complexity, Time complexity Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation Probabilistic analysis, Amortized analysis
Reference Books
T1 T1 T1 T1 TOTAL
No.of periods
2 2 2 2 8
UNIT-II
Disjoint Sets:
S.NO
2.1 2.2 2.3
Concept
disjoint set operations, union and find algorithms spanning trees connected components and biconnected components
Reference Books
T1 T1 T1 TOTAL
No. of periods 2
2 2 6
UNIT-III
Divide and conquer:
S.NO
3.1 3.2 3.3 3.4 3.5
Concept
General method applications-Binary search Quick sort Merge sort Strassens matrix multiplication
Reference Books
T1 T1 T1 T1 T1 TOTAL
No. of periods
1 2 3 2 1 9
UNIT-IV
Greedy method:
S.NO
4.1 4.2 4.3 4.4 4.5
Concept
General method applications-Job sequencing with dead lines 0/1 knapsack problem Minimum cost spanning trees Single source shortest path problem.
Reference Books
T1 T1 T1 T1 T1 TOTAL
No. of periods
1 2 2 2 1 8
UNIT-V
Dynamic Programming:
S.NO
5.1 5.2 5.3 5.4 5.5 5.6 5.7
Concept
General method applications-Matrix chain multiplication Optimal binary search trees 0/1 knapsack problem All pairs shortest path problem Travelling sales person problem Reliability design.
Reference Books
T1 T1 T1 T1 T1 T1 T1 TOTAL
No. of periods
1 1 3 2 2 1 2 12
UNIT-VI
Backtracking:
S.NO
6.1 6.2 6.3 6.4 6.5
Concept
General method applications-n-queen problem sum of subsets problem graph coloring, Hamiltonian cycles
Reference Books
T1 T1 T1 T1 T1 TOTAL
No. of periods
1 1 1 1 1 5
UNIT-VII
Branch and Bound:
S.NO
7.1 7.2 7.3 7.4 7.5
Concept
General method applications - Travelling sales person problem 0/1 knapsack problem LC Branch and Bound solution FIFO Branch and Bound solution
Reference Books
T1 T1 T1 T1 T1 TOTAL
No. of periods
1 2 2 2 1 8
UNIT-VIII
NP-Hard and NP-Complete problems:
S.NO
8.1 8.2 8.3 8.4
Concept
Basic concepts non deterministic algorithms NP - Hard and NPComplete classes Cooks theorem
Reference Books
T1,T2 T1,T2 T1,T2 T1,T2 TOTAL
No. of periods
1 2 1 1 5
: 61
TEXT BOOKS : 1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharam,Galgotia publications pvt. Ltd. 2. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia,John wiley and sons. REFERENCES : 1. Introduction to Algorithms, secondedition,T.H.Cormen,C.E.Leiserson, R.L.Rivest,and C.Stein,PHI Pvt. Ltd./ Pearson Education 2. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee, S.S.Tseng, R.C.Chang and T.Tsai, Mc Graw Hill. 3. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Pearson education. 4. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education. 5. Algorithms Richard Johnson baugh and Marcus Schaefer, Pearson Education
Prepared By :
Verified By :
Authorized By: