Scribd
Upload
21 views4 pages

Lesson Plan DAA 22CSE43

Uploaded by

sowmyabkdaa
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
21 views4 pages

Lesson Plan DAA 22CSE43

Uploaded by

sowmyabkdaa
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
You are on page 1/ 4

GLOBAL ACADEMY OF TECHNOLOGY

(An Autonomous Institute under VTU)


Department of Computer Science & Engineering
Affiliated to VTU, Accredited by NAAC with 'A' grade
RR Nagar, Bengaluru – 560 098
(Accredited by NBA 2022-2025)

Course Title: Design and Analysis of Algorithms Course Code: 22CSE43


Total Contact Hours: 36 Credits: 4
SEE Marks: 50 CIE Marks: 50
Semester: 4 Academic Year: 2023-24
Lesson Plan Author: Dr.GRS,Dr.RKV,SBK Date: 13th May 2024

WEEK Class MAIN TOPICS SUB TOPICS


Introduction to Algorithms, Notion of algorithm & Properties, Problem
1
types
1
2 Algorithm’s to find GCD & Sieve of Eratosthenes
3 MODULE I Efficiency & Efficiency Classes of an Algorithm, Frame Work
4 Introduction to Algorithms Asymptotic Notations
2 5 Mathematical Analysis of Non-recursive Algorithms.
6 Mathematical Analysis of Recursive Algorithms.
3 7 Master Theorem

Department of CSE, GAT Page: 1 Design & Analysis of Algorithms


8 Brute Force : Bubble Sort
9 Brute Force : String Matching
10 Divide & Conquer : Introduction & Binary search
MODULE II
4 11 Merge Sort
Brute Force, Divide &
12 Quick Sort
Conquer
13 Strassen’s Matrix Multiplication , Multiplication of 2 Large integers
14 Max- Min Element in an array
5
15 Decrease & Conquer : Introduction and its Variations, Insertion Sort
16 Graph Traversal : DFS & BFS , and there applications
MODULE III
6 17 Topological Sort : DFS method & Source removal method
Decrease & Conquer,
18 MODULE IV Fake Coin & Johnson Trotter Problem
19 Transform & Conquer Transform & Conquer : Introduction and its variations,
7 20 AVL & 2-3 Tree
21 Heap & Heap Sort
Dynamic Programming : Introduction and an example problem
22
(Binomial Coefficient & Fibinooci Number)
8 23 Floyd’s and Warshall’s Algorthim
MODULE IV ‘s Al
24 0/1 KnapSack Problem
Dynamic Programming
25 Memory Functions
MODULE III
26 Bellman Ford algorithm
9 Greedy Technique
27 Greedy Technique : Introduction & Prim’s Algorithm
28 Kruskal’s Algorithm, Huffman Code
10 29 Dijkstra’s Algorithm : Single Source Shortest Path

Department of CSE, GAT Page: 2 Design & Analysis of Algorithms


30 Greedy Solution to Knapsack & Job Sequencing
30 Back Tracking : Introduction & Subset Problem
31 N-Queen’s Problem
32 Hamiltonian Cycle
11 33 MODULE V Branch & Bound : Introduction & TSP Problem
Back Tracking, Branch &
34 Assignment & Knapsack problem
Bound, P ,NP and NP
35 Introduction to P,NP and NP Complete Problems
Complete
12 36 Decision Trees for sorting and searching
37 Conclusion Class

Reference Books:
1. Introduction to the Design and Analysis of Algorithms, Anany Levitin, University, 3rd Edition, 2012, Pearson, ISBN 13:
978-0-13-231681-1.
2. Ellis Horowitz, Sartaj Sahni & Sanguthevar Rajasekaran, “Computer Algorithms/C++”, University Press, 2nd Edition,
Reprint 2017.

Course Outcomes: Upon completion of the course, students shall be able to

CO43.1: Explain the basic techniques of analysing the algorithms using time & space complexity and asymptotic
notations.
CO43.2: Devise algorithms using brute force and Divide and Conquer techniques for a given problem.
CO43.3: Demonstrate Graph Algorithms using greedy method, Transform and Conquer Approach to model Engineering
Problems.
CO43.4: Employ Dynamic Programming and Decrease & Conquer strategies to solve a given problem.
CO43.5: Use Back Tracking, Branch and Bound design techniques for solving Computationally hard problems.

Department of CSE, GAT Page: 3 Design & Analysis of Algorithms


Course Unitization for CIE and Semester End Examination

Teaching No of Questions
Unit Chapter
Hours CIE -1 CIE -2 CIE - 3 SEE
1 MODULE I
8 2 - - 2
Introduction to Algorithms
2 MODULE II
8 2 - - 2
Brute Force, Divide & Conquer
3 MODULE III
Decrease & Conquer 8 1 2 2
-
MODULE IV
Transform & Conquer
4 MODULE IV
Dynamic Programming
8 - 3 2 2
MODULE III
Greedy Technique
5 MODULE V
8 - - 3 2
Back Tracking, Branch & Bound, P,NP & NP Complete

Faculty In charge: Dr.GRS,Dr.RKV,SBK Head of Department


Date: 13th May 2024

Department of CSE, GAT Page: 4 Design & Analysis of Algorithms

You might also like