Scribd
Upload
36 views3 pages

Daa TLP

good

Uploaded by

madhu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views3 pages

Daa TLP

good

Uploaded by

madhu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

MVR COLLEGE OF ENGINEERING AND TECHNOLOGY, PARITALA

Approved by AICTE, New Delhi, Affiliated to JNTUK, Kakinada


Accredited By NBA(CSE), Accredited By NAAC with ‘A’ Grade,ISO:9001-2008,
Paritala, Kanchikacherla, Krishna Dist., AP—521180.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

LESSON PLAN

Regulation: R20

Class : III B.Tech –II SEM Course : DESIGN AND ANALYSIS OF ALGORITHMS
Name of the Faculty : N. MADHU BINDU Academic Year : 2021-2022

S.No Topic Mode of Proposed Conducted Remarks


teaching date date
UNIT-I
1 Introduction: Algorithm Definition BB 14/02/22
2 Algorithm Specification BB 15/02/22
3 performance Analysis BB 16/02/22
4 Performance measurement BB 17/02/22
5 Asymptotic notation BB 18/02/22
6 Randomized Algorithms PPT 19/02/22
7 Introduction Sets & Disjoint set BB 21/02/22
union
8 union and find operations BB 22/02/22
9 Introduction Basic Traversal & Search BB 23/02/22
Techniques
10 connected components and PPT 24/02/22
Spanning Trees
11 Bi-connected components BB 25/02/22
12 DFS BB 26/02/22
UNIT – II
13 Introduction Divide and Conquer BB 02/03/2022
14 General Method BB 03/03/2022
15 Defective chessboard BB 04/03/2022
16 Binary Search PPT 05/03/2022
17 Finding the maximum and minimum BB 07/03/2022
18 Merge sort BB 08/03/2022
19 Quick sort BB 09/03/2022
20 Introduction to Greedy Method BB 10/03/2022
21 The general Method PPT 11/03/2022
22 container loading BB 12/03/2022
23 knapsack problem BB 14/03/2022
24 Job sequencing with deadlines PPT 15/03/2022
25 minimum-cost spanning Trees BB 16/03/2022
UNIT – III
26 Introduction Dynamic Programming BB 22/03/2022
27 The general method BB 23/03/2022
28 multistage graphs PPT 24/03/2022
29 All pairs-shortest paths BB 25/03/2022
30 single-source shortest paths BB 26/03/2022
31 general weights PPT 28/03/2022
32 optimal Binary search trees BB 29/03/2022
33 0/1 knapsack PPT 31/03/2022
34 reliability Design BB 11/04/2022
35 The traveling salesperson problem BB 12/04/2022
36 matrix chain multiplication BB 13/04/2022
UNIT – IV
37 Introduction to Backtracking BB 16/04/2022
38 The General Method BB 18/04/2022
39 The 8-Queens problem PPT 19/04/2022
40 sum of subsets BB 20/04/2022
41 Graph coloring BB 21/04/2022
42 Hamiltonian cycles PPT 22/04/2022
44 knapsack problem BB 23/04/2022
45 Introduction to Branch and Bound BB 25/04/2022
46 FIFO Branch-and-Bound PPT 26/04/2022
47 LC Branch-and-Bound BB 27/04/2022
48 0/1 Knapsack problem BB 28/04/2022
49 Traveling salesperson problem PPT 29/04/2022
UNIT – V
50 NP-Hard and NP-Complete problems PPT 02/05/2022
51 Basic concepts BB 04/05/2022
52 Cook’s Theorem. BB 07/05/2022
53 Introduction String Matching BB 09/05/2022
54 String Matching-Meaning PPT 10/05/2022
55 Meaning and Application BB 11/05/2022
56 NaÏve String Matching Algorithm BB 12/05/2022
57 Rabin-Karp Algorithm PPT 16/05/2022
58 Knuth-Morris-Pratt Automata BB 20/05/2022
60 Tries PPT 21/05/2022
61 Suffix Tree BB 23/05/2022
COS Unit no CO
Able to analyze the performance measurement of algorithms (using asymptotic notations)
CO 1 1 and randomized algorithms.
Able to discuss divide and conquer method and use this method in designing appropriate
CO 2 2 searching and sorting algorithms and describe Greedy method and use this method in
designing of various applications.
Able to explain Dynamic programming method and use this method in implementation of
CO 3 3 various applications
Able to design various algorithms using backtracking which improves the performance by
CO 4 4 elimination of unnecessary cases. Use branch and bound algorithms for finding optimal
solution
Understanding of NP- Completeness theory and lower bound theory
CO 5 5

FACULTY HOD PRINCIPAL

You might also like