DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

LESSON PLAN

Name : Ms. E. Ruthra Designation : Assistant Professor

Branch : CSE Subject code : CS3401
Year/Semester : II / IV Subject Name : ALGORITHMS
Course Coordinator : Ms. E. Ruthra LTPC :3024
Course Outcome: Regulation : 2021

C214.1 Analyze the efficiency of algorithms using various frameworks.

C214.2 Apply graph algorithms to solve problems and analyze their efficiency.
C214.3 Make use of algorithm design techniques like divide and conquer, dynamic programming and
greedy techniques to solve problems
C214.4 Use the state space tree method for solving problems.
C214.5 Solve problems using approximation algorithms and randomized algorithms

Topics Period Date Text/ Delivery Course

Reference Method Outcome
Planned Completed book

UNIT I- INTRODUCTION

Algorithm analysis: Time Chalk and

1 26/02/2025 T1 C214.1
and space complexity Board
Asymptotic Notations and
its properties Best case, Chalk and
2 27/02/2025 T1 C214.1
Worst case and average case Board
analysis
Recurrence relation: Chalk and
3 28/02/2025 T1 C214.1
substitution method Board
Lower bounds Chalk and
4 03/03/2025 T1 C214.1
Board
Searching: linear search, Chalk and
5 04/03/2025 T1 C214.1
binary search Board
Interpolation Search, Pattern Chalk and
6 05/03/2025 T1 C214.1
search Board
The naïve string-matching Chalk and
7 06/03/2025 T1 C214.1
algorithm Board
Rabin-Karp algorithm -
Chalk and
Knuth-Morris-Pratt 8 07/03/2025 T1 C214.1
Board
algorithm
Sorting: Insertion sort – Chalk and
9 10/03/2025 T1 C214.1
heap sort Board

UNIT II GRAPH ALGORITHMS

Graph algorithms: Chalk and

Representations of graphs 10 11/03/2025 T1 C214.2
Board

JEC 7.3 / LP
Graph traversal: DFS – BFS Chalk and
- applications 11 12/03/2025 T1 C214.2
Board
Connectivity, strong Chalk and
connectivity, bi-connectivity 12 13/03/2025 T1 C214.2
Board
Minimum spanning tree: Chalk and
Kruskal’s and Prim’s 13 14/03/2025 T1 C214.2
algorithm Board
Shortest path: Bellman-Ford Chalk and
algorithm 14 17/03/2025 T1 C214.2
Board
Dijkstra’s algorithm - Floyd- Chalk and
Warshall algorithm 15 18/03/2025 T1 C214.2
Board
Network flow: Flow Chalk and
networks 16 19/03/2025 T1 C214.2
Board
Ford-Fulkerson method Chalk and
17 20/03/2025 T1 C214.2
Board
Matching: Maximum Chalk and
bipartite matching 18 21/03/2025 T1 C214.2
Board

UNIT III ALGORITHM DESIGN TECHNIQUES

Divide and Conquer Chalk and

methodology: Finding 19 24/03/2025 T1 C214.3
maximum and minimum Board
Merge sort - Quick sort Chalk and
20 25/03/2025 T1 C214.3
Board
Dynamic programming: Chalk and
Elements of dynamic 21 26/03/2025 T1 C214.3
programming Board
Matrix-chain multiplication Chalk and
22 27/03/2025 T1 C214.3
Board
Multi stage graph-Optimal Chalk and
Binary Search Trees 23 28/03/2025 T1 C214.3
Board
Greedy Technique: Chalk and
Elements of the greedy 24 01/04/2025 T1 C214.3
strategy Board
Activity-selection problem Chalk and
25 02/04/2025 T1 C214.3
Board
Optimal Merge pattern Chalk and
26 03/04/2025 T1 C214.3
Board
Huffman Trees Chalk and
27 04/04/2025 T1 C214.3
Board

UNIT IV STATE SPACE SEARCH ALGORITHMS

Backtracking: n-Queens Chalk and

problem 28 07/04/2025 T1 C214.4
Board
Hamiltonian Circuit Chalk and
Problem 29 08/04/2025 T1 C214.4
Board
Subset Sum Problem Chalk and
30 09/04/2025 T1 C214.4
Board
Graph colouring problem Chalk and
31 11/04/2025 T1 C214.4
Board
Branch and Bound: Solving Chalk and
15-Puzzle problem 32 15/04/2025 T1 C214.4
Board
Assignment problem 1 33 16/04/2025 T1 Chalk and C214.4

JEC 7.3 / LP
 Board
Assignment problem 2 Chalk and
34 17/04/2025 T1 C214.4
Board
Knapsack Problem Chalk and
35 21/04/2025 T1 C214.4
Board
Travelling Salesman Chalk and
Problem 36 22/04/2025 T1 C214.4
Board

UNIT V NP-COMPLETE AND APPROXIMATION ALGORITHM

Tractable and intractable Chalk and

problems: Polynomial time 37 24/04/2025 T1 C214.5
algorithms Board
Venn diagram representation Chalk and
38 25/04/2025 T1 C214.5
Board
NP-algorithms - NP- Chalk and
hardness and NP- 39 28/04/2025 T1 C214.5
completeness Board
Bin Packing problem Chalk and
40 29/04/2025 T1 C214.5
Board
Problem reduction: TSP – 3- Chalk and
CNF problem 41 02/05/2025 T1 C214.5
Board
Approximation Algorithms: Chalk and
TSP 42 05/05/2025 T1 C214.5
Board
Randomized Algorithms: Chalk and
concept and application 43 06/05/2025 T1 C214.5
Board
primality testing - Chalk and
randomized quick sort 44 07/05/2025 T1 C214.5
Board
Finding kth smallest number Chalk and
45 08/05/2025 T1 C214.5
Board

Books Referred:

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:

R1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd Edition, Pearson
Education, 2012.
R2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "Data Structures and Algorithms",
Reprint Edition, Pearson Education, 2006.
R3. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.

Staff in Charge Course Coordinator Head of the Department Principal

Note: Content beyond the syllabus should not to be planned at the end of all units, it should be planned based on the need
(Erase the Note; it is only for understanding purpose)

JEC 7.3 / LP