Scribd
Upload
5 views1 page

DAA Lecture Plan: Algorithms & Techniques

The document outlines a detailed lecture plan for a course on Design and Analysis of Algorithms (DAA), covering various topics such as algorithm characteristics, analysis techniques, and different algorithmic strategies including brute-force, divide and conquer, greedy, dynamic programming, backtracking, and network flow. Each lecture is mapped to specific course outcomes (CO) and includes practical examples and performance measurements. The plan also addresses computability classes and concludes with a revision session and a surprise test.

Uploaded by

megha.5580
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

DAA Lecture Plan: Algorithms & Techniques

The document outlines a detailed lecture plan for a course on Design and Analysis of Algorithms (DAA), covering various topics such as algorithm characteristics, analysis techniques, and different algorithmic strategies including brute-force, divide and conquer, greedy, dynamic programming, backtracking, and network flow. Each lecture is mapped to specific course outcomes (CO) and includes practical examples and performance measurements. The plan also addresses computability classes and concludes with a revision session and a surprise test.

Uploaded by

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

Lecture Plan- Subject:DAA

Lecture Date of topic


Topics/ Contents CO Mapped
Schedule covered
Lecture 1 Characteristics of algorithm, Steps for algorithm design
Analysis of algorithm: Asymptotic analysis of complexity bounds –
Lecture 2
best, average and worst-case behavior
Lecture 3 Performance measurements of Algorithm
Lecture 4 Time and space trade-offs CO 1
Analysis of recursive algorithms through recurrence relations:
Lecture 5
Substitution method
Lecture 6 Recursion tree method
Lecture 7 Masters’ theorem
Lecture 8 Brute-Force introduction
Lecture 9 Brute-Force examples
Lecture 10 Divide and Conquer Technique introduction
Divide and Conquer Technique Examples Mergesort, Binary Search,
Lecture 11
Quicksort CO 1, 2
Lecture 12 Greedy Technique introduction,
Lecture 13 Greedy Technique Examples (Fractional Knapsack)
Dynamic Programming Technique introduction (0/1 Knapsack
Lecture 14
Problem, Bin packing)
Lecture 15 Dynamic Programming Technique examples(0/1 Knapsack, TSP)
Lecture 16 Backtracking Technique introduction, N-queens Problem
Lecture 17 Backtracking Technique and examples (0/1 Knapsack)
Lecture 18 Branch- and-Bound Technique and examples (0/1 Knapsack)
Traversal algorithms: Depth First Search (DFS) and Breadth First
Lecture 19
Search (BFS)
Lecture 20 Traversal algorithms: Breadth First Search (BFS);
Lecture 21 Shortest path algorithms
Lecture 22 Transitive closure
Lecture 23 Minimum Spanning Tree CO 3
Lecture 24 Minimum Spanning Tree examples
Lecture 25 Topological sorting,
Lecture 26 Topological sorting examples
Lecture 27 Network Flow Algorithm
Lecture 28 Network Flow Algorithm
Lecture 29 Computability of Algorithms,
Lecture 30 Computability of Algorithms
Lecture 31 Computability classes – P, NP
CO 4
Lecture 32 Comp Computability classes – NP-complete and NP-hard
Lecture 33 Cook’s theorem,
Lecture 34 Cook’s theorem,
Lecture 35 Standard NP-complete problems and
Lecture 36 Reduction techniques.
Lecture 37 Approximation algorithms, characteristics and examples
Lecture 38 Randomized algorithms,
CO 5
Lecture 39 Heuristics and their characteristics
Lecture 40 Revision/ Surprise test

Signature of Subject teacher

You might also like