DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Lesson Planning Sheet

Degree: B.E., Branch: CSE Semester: IV

OBJECTIVES:
 To understand and apply the algorithm analysis techniques on searching and sorting
algorithms
 To critically analyze the efficiency of graph algorithms
 To understand different algorithm design techniques
 To solve programming problems using state space tree
 To understand the concepts behind NP Completeness, Approximation algorithms
and randomized algorithms.
Text/ Methodology
No. of
S.N Reference (BB,OHP, Date Date
Topics to be covered Lecture
o Book & PPT, Proposed Engaged
Hours
Pg. No. Others)*
UNIT I INTRODUCTION (9 hours)
1. Algorithm analysis:
Time and space
complexity - 2 T1/ Pg 6 BB
Asymptotic Notations
and its properties
2. Best case, Worst case
and average case 1 T1 / Pg 8 BB
analysis
3. Recurrence relation:
substitution method
Lower bounds – 1 T1 / Pg 24 BB
searching: linear
search
4. binary search and
2 T2 / Pg 33 BB,PPT
Interpolation Search,
5. Pattern search: The
naïve string- 1 T1 / Pg 36 BB,PPT
matching algorithm
6. Rabin-Karp algorithm
- Knuth-Morris - Pratt 1 T1 / Pg 81 BB
algorithm
7. Sorting: Insertion sort
1 T1 / Pg 102 BB
– heap sort
UNIT II GRAPH ALGORITHMS (9 hours)
8. Graph algorithms:
Representations of 1 T1 / pg 119 BB
graphs
9. Graph traversal: DFS 2 T1 / pg 135 BB
– BFS - applications -
 Connectivity, strong
connectivity
10. bi-connectivity -
Minimum spanning
2 T1 / pg 142 BB
tree: Kruskal’s and
Prim’s algorithm
11. Shortest path:
Bellman-Ford
algorithm - Dijkstra’s 2 T1 / pg 170 BB
algorithm - Floyd-
Warshall algorithm
12. Network flow: Flow
networks - Ford-
Fulkerson method – 2 T1 / pg 203 BB
Matching: Maximum
bipartite matching
UNIT III ALGORITHM DESIGN TECHNIQUES (9 hours)
13. Divide and Conquer
methodology: Finding
2 T1 / pg 242 BB
maximum and
minimum
14. Merge sort - Quick
sort Dynamic 2 T1 / pg 267 BB
programming
15. Elements of dynamic
programming,
1 T1 / pg 308 BB
Matrix-chain
multiplication
16. Multi stage graph —
Optimal Binary 1 T1 / pg 340 BB
Search Trees
17. Greedy Technique:
Elements of the 1 T1 / pg 341 BB
greedy strategy
18. Activity-selection
problem 1 T1 / pg 355 BB
19. Optimal Merge
pattern — Huffman 1 T1 / pg 359 BB
Trees.
UNIT IV STATE SPACE SEARCH ALGORITHMS (9hours)
20. Backtracking: n-
Queens problem 2 T1 / pg 393 BB
21. Hamiltonian Circuit BB
& Subset Sum 2 T1 / pg 396
Problem
22. Graph colouring
problem 1 T1 / pg 418 BB
23. problem Branch and
Bound: Solving 2 T1 / pg 499
24. 15 Puzzle problem -
Assignment problem 2 T1 / pg 514
25. Knapsack - Travelling
Salesman Problem 1 T1 / pg 530
UNIT V NP-COMPLETE AND APPROXIMATION ALGORITHM (9 hours)
26. Tractable and BB
intractable problems:
Polynomial time
2 T1 / pg 700
algorithms, Venn
diagram
representation
27. NP-NP-hardness and BB
NP-completeness 2 T1 / pg 708
28. Bin Packing problem BB,PPT
- Problem reduction:
TSP – 3- CNF
problem. 1 T1 / pg 718
Approximation
Algorithms: TSP -
Randomized
29. primality testing - BB
randomized quick sort
2 T1 / pg 745
- Finding kth smallest
number

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Analyze the efficiency of algorithms using various frameworks
CO2: Apply graph algorithms to solve problems and analyze their efficiency.
CO3: Make use of algorithm design techniques like divide and conquer, dynamic
programming and greedy techniques to solve problems
CO4: Use the state space tree method for solving problems.
CO5: Solve problems using approximation algorithms and randomized algorithms
TEXT BOOKS:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
"Introduction to Algorithms", 3rd Edition, Prentice Hall of India, 2009.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran “Computer Algorithms/C+
+” Orient Blackswan, 2nd Edition, 2019.
REFERENCES:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd
Edition, Pearson Education, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "Data Structures and
Algorithms", Reprint Edition, Pearson Education, 2006.
3. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.