COURSE PLAN

SY, MCA, MCA - II, MGT, (SEMESTER II)

Design & Analysis of Algorithms (Theory)
Sr.
No
.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

Unit
No
UNIT
1
UNIT
1
UNIT
1
UNIT
1
UNIT
1
UNIT
1
UNIT
1
UNIT
1
UNIT
1
UNIT
1
UNIT
2
UNIT
2
UNIT
2
UNIT
2
UNIT
2
UNIT
2
UNIT
2
UNIT
3
UNIT

Unit
Description

Proposed
Span

No. of
Lecture
s

Actual
Covere
d Date

Topics to be covered

Introduction

Algorithm, analysis

Introduction

time complexity

Introduction

space complexity

Introduction

O-notation

Introduction

Omega Notation

Introduction

Theta notation,

Introduction

Heaps and Heap sort,

Introduction

Sets and disjoint set,

Introduction

Union and find algorithms.

Introduction

Sorting in linear time.

Divide and Conquer: General

Strategy, Exponentiation.

Binary Search,

Binary Search,

Quick Sort

Quick Sort

Merge Sort

Merge Sort

General Strategy

Knapsack problem,

Divide &
Conquer
Divide &
Conquer
Divide &
Conquer
Divide &
Conquer
Divide &
Conquer
Divide &
Conquer
Divide &
Conquer
Greedy
Method
Greedy

20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

Method

UNIT
3

Greedy
Method

UNIT
3
UNIT
3
UNIT
3
UNIT
3
UNIT
3
UNIT
3
UNIT
3
UNIT
3
UNIT
4
UNIT
4
UNIT
4
UNIT
4
UNIT
4
UNIT
4
UNIT
4
UNIT
5
UNIT
5
UNIT
5
UNIT
5
UNIT
5
UNIT
5

Greedy
Method
Greedy
Method
Greedy
Method
Greedy
Method
Greedy
Method
Greedy
Method
Greedy
Method
Greedy
Method
Dynamic
Programming
Dynamic
Programming
Dynamic
Programming
Dynamic
Programming
Dynamic
Programming
Dynamic
Programming
Dynamic
Programming

Knapsack problem
1
1

Job sequencing with Deadlines,

Job sequencing with Deadlines,

Optimal merge patterns,

Optimal merge patterns,

Minimal Spanning Trees

Minimal Spanning Trees

Dijkstras algorithm.

Dijkstras algorithm.

General Strategy

Multistage graphs,

OBST,

0/1 Knapsack,

Traveling Salesperson Problem,

Traveling Salesperson Problem,

Flow Shop Scheduling

Backtracking

Backtracking: General Strategy,

Backtracking

8 Queens problem,

Backtracking

8 Queens problem,

Backtracking

Graph Coloring

Backtracking

Hamiltonian Cycles,

Backtracking

0/1 Knapsack

42
43
44
45
46

UNIT
5
UNIT
6
UNIT
6
UNIT
6
UNIT
6

47

UNIT
7

48

UNIT
7

Backtracking
Branch and
Bound
Branch and
Bound
Branch and
Bound
Branch and
Bound
NP HRD &
NP
COMPLETE
PROBLEM
NP HRD &
NP
COMPLETE
PROBLEM

0/1 Knapsack

General Strategy, 0/1 Knapsack,

General Strategy, 0/1 Knapsack,

Traveling Salesperson Problem

Traveling Salesperson Problem

Basic concepts, non-deterministic

algorithms,

NP-HARD and NP-COMPLETE

classes, COOKS theorem