LECTURE PLAN
Course Code & Name
: 080230013/Designs
And Analysis of Algorithms
Faculty :
Class & Semester : II Year BE (CSE) – IV Semester
|
Sl. No.
|
PROPOSED
|
TOPIC
|
|
|
DATE
|
PERIOD |
||
|
1
|
07.12.11
|
|
Module I : Introduction
|
|
2
|
08.12.11
|
|
Algorithm Analysis
|
|
3
|
09.12.11
|
|
Time Space Tradeoff
|
|
4
|
13.12.11
|
|
Asymptotic Notations
|
|
5
|
14.12.11
|
|
Conditional asymptotic notation
|
|
6
|
15.12.11
|
|
Tutorial 1
|
|
7
|
16.12.11
|
|
Properties of big-Oh notation
|
|
8
|
19.12.11
|
|
Removing condition from the conditional asymptotic
notation
|
|
9
|
20.12.11
|
|
Recurrence equations
|
|
10
|
21.12.11
|
|
Properties
of big-oh notation
|
|
11
|
22.12.11
|
|
Tutorial 2
|
|
12
|
23.12.11
|
|
Solving recurrence equations
|
|
13
|
26.12.11
|
|
Properties of big-Oh notation.
|
|
14
|
27.12.11
|
|
Analysis of linear search.
|
|
15
|
28.12.11
|
|
Review
1
|
|
16
|
29.12.11
|
|
Module II: Introduction to Divide and Conquer:
|
|
17
|
30.12.11
|
|
General Method
|
|
18
|
02.01.12
|
|
Binary Search
|
|
19
|
03.01.12
|
|
Tutorial 3
|
|
20
|
04.01.12
|
|
Finding Maximum and Minimum
|
|
21
|
05.01.12
|
|
Finding Maximum and Minimum continue
|
|
22
|
06.01.12
|
|
Tutorial 4
|
|
23
|
09.01.12
|
|
Merge
sort
|
|
24
|
10.01.12
|
|
Greedy Algorithms: General Method
|
|
25
|
11.01.12
|
|
Tutorial 5
|
|
26
|
18.01.12
|
|
Container Loading
|
|
27
|
19.01.12
|
|
Knapsack Problem
|
|
28
|
20.01.12
|
|
|
|
29
|
23.01.12
|
|
Tutorial 6
|
|
30
|
27.01.12
|
|
Review
2
|
|
31
|
30.01.12
|
|
Module III: Dynamic Programming
|
|
32
|
31.01.12
|
|
General Method
|
|
33
|
01.02.12
|
|
Multistage Graphs
|
|
34
|
02.02.12
|
|
Tutorial 7
|
|
35
|
03.02.12
|
|
All-Pair shortest paths
|
|
36
|
06.02.12
|
|
|
|
37
|
07.02.12
|
|
Tutorial 8
|
|
38
|
08.02.12
|
|
Optimal binary search trees
|
|
39
|
09.02.12
|
|
|
|
40
|
10.02.12
|
|
0/1 Knapsack
|
|
41
|
13.02.12
|
|
Tutorial 9
|
|
42
|
14.02.12
|
|
Travelling salesperson problem
|
|
43
|
15.02.12
|
|
Tutorial 10
|
|
44
|
16.02.12
|
|
Review
3
|
|
45
|
17.02.12
|
|
Module IV: Backtracking
|
|
46
|
23.02.11
|
|
General Method
|
|
47
|
24.02.12
|
|
8 Queens problem
|
|
48
|
27.02.12
|
|
|
|
49
|
28.02.12
|
|
Tutorial 11
|
|
50
|
29.02.12
|
|
sum of subsets
|
|
51
|
01.03.12
|
|
|
|
52
|
02.03.12
|
|
Tutorial 12
|
|
53
|
05.03.12
|
|
Hamiltonian problem
|
|
54
|
06.03.12
|
|
|
|
55
|
07.03.12
|
|
graph coloring
|
|
56
|
08.03.12
|
|
Tutorial 13
|
|
57
|
09.03.12
|
|
knapsack problem.
|
|
58
|
10.03.12
|
|
Tutorial 14
|
|
59
|
12.03.11
|
|
Review
4
|
|
60
|
14.03.12
|
|
Module V: Graph Traversals
|
|
61
|
15.03.12
|
|
Tutorial 15
|
|
62
|
16.03.12
|
|
Connected Components
|
|
63
|
23.03.12
|
|
Spanning Trees
|
|
64
|
24.03.12
|
|
Tutorial 16
|
|
65
|
05.04.12
|
|
Biconnected components
|
|
66
|
07.04.12
|
|
Branch and Bound
|
|
67
|
12.04.12
|
|
General Methods (FIFO & LC)
|
|
68
|
16.04.12
|
|
0/1 Knapsack problem
|
|
69
|
17.04.12
|
|
Tutorial 17
|
|
70
|
18.04.12
|
|
Introduction to NP-Hard and NP-Completeness.
|
|
71
|
19.04.12
|
|
Review
5
|
Faculty in- charge
HOD/CSE PRINCIPAL
No comments:
Post a Comment