Lesson Plan : Analysis & Design of Algorithms

Back

Lesson Plan
Name of the Faculty   : DEEPIKA GARG
Discipline                     : B.TECH
Semester                       : VI Sem
Subject                          : Analysis & Design of Algorithms
Paper Code                   : CSE-306-F
Lesson plan duration : From Jan 2018 to April 2018
work load lecture per week(in hours):3 lectures
Week	Theory
	Lecture Day	Topic
1st	1	General method
	2	knapsack problem
	3	Job sequencing with dead lines
2nd	4	Prim’s and Kruskal’s Method
	5	Single souce paths
	6	General method
3rd	7	Optimal binary search tree
	8	O/I knapsack
	9	Traveling salesperson problem
4th	10	Revision of Section B.
	11	Asymptotic Notations
	12	Graphs
5th	13	Sets and disjoint sets, union
	14	Binary Search
	15	General method
6th	16	Bubble, Insertion, Selection Sort.
	17	Merge and Quick Sort.
	18	Strassen‟s matrix multiplicationalgorithms
7th	19	Revision of Section A
	20	General method.
	21	8 queen‟s problem
8th	22	Graph colouring
	23	Hamiltonian cycle
	24	General method
9th	25	O/I knapsack problem
	26	Traveling salesperson problem
	27	Lower bounds on parallel computations
10th	28	Revision of Unit 3.
	29	Basic concepts, Cook‟s theorem.
	30	NP hard graph and NP scheduling problems some simplified NP hard problems.
11th	31	NP hard graph and NP scheduling problems somesimplified NP hard problems.