VIVEKANANDHA COLLEGE OF ENGINEERING FOR

WOMEN
(AUTONOMOUS)
Department of Information Technology
U14IT405 Design & Analysis of Computer Algorithm
YEAR / SEM : II/IV

BATCH :

2014-2018
Sessio
n No
1

5
6

Topics to be covered

Time
Teachin
(Minute
g
s)
Method
UNIT I BASIC TOOLS ON DESIGNING ALGORITHMS
What is an Algorithm? & How to
90
BB
Create
Validate
Analyze
Test Algorithm
Algorithm Specification
90
BB
Pseudocode Conventions
Selection Sort
45
BB
Recursive Algorithms
Towers of Hanoi
Performance Analysis
90
BB/PPT
Space Complexity
Time Complexity
90
BB/PPT
Asymptotic Notation (O, , )
Performance Measurement
Sequential Search
Randomized Algorithms
90
BB
Basics of Probability theory
Informal Description
45
BB
Identifying the Repeated
Element
Advantages & Disadvantages
UNIT II DIVIDE & CONQUER AND GREEDY METHOD
Introduction about Divide & Conquer
45
BB
General Method
Binary Search
45
BB
Problems
Application to binary Search
Finding Minimum and Maximum
45
BB/PPT
Straightforward
Recursive
Merge Sort
45
BB
Performance Measurement
Randomized Sorting Algorithms

Text /
Ref
A

A, B

A, B
A, B

A, B

A, C

A, C

A, B
A, C

A, B

A, D

10

11
12
13
14
15
16

17
18

19

20

21
22
23
24
25
26
27
28
29
30
31

32
32

Quick Sort
90
BB
Performance Measurement
Randomized Sorting Algorithms
Problem of Selection
45
BB/PPT
Worst-Case optimal algorithm
Implementation
Strassens Matrix Multiplication
45
BB/PPT
Introduction about Greedy Method
45
BB
General Method
Knapsack Problem
45
BB
Tree vertex Splitting
45
BB/PPT
Job Sequencing with Deadlines
45
BB/PPT
Minimum Cost Spanning Trees
90
BB
Prims Algorithm
Kruskals Algorithm
Optimal Storage on Tapes
45
BB/PPT
Optimal Merge patterns
45
BB/PPT
Huffman Codes
UNIT III DYNAMIC PROGRAMMING & BACKTRACKING
Introduction about Dynamic
45
BB
Programming
General Method
Multistage Graphs
45
BB/PPT
Application to Multistage
graphs
All Pair Shortest Paths
45
BB
General Weights
Optimal Binary search Trees
45
BB
0/1 Knapsack
45
BB
Traveling Salesman Problem
45
BB
Flow Shop Scheduling
45
BB
Introduction about Backtracking
90
BB
General Method
4 & 8-Queen Problem
45
BB
Application
8-Puzzle Problem
45
BB
Application
Sum of Subsets
45
BB
Graph Coloring & Hamiltonian Cycles
90
BB/PPT
UNIT IV BRANCH & BOUND
Introduction about Branch & Bound
90
BB
General Method
Least Cost Method
FIFO
15-Puzzle Problem
45
BB
0/1 Knapsack Problem
90
BB/PPT
Least Cost
FIFO

A, D

A, C

A, C
A, B
A
A
A
A, B

A, C
A, C

A, B

A, D

A, D
A, D
A, B
A, B
A
A, B
A, B
B, D
A, D
A, C
A, B

A, B
A, C

33
34
35

36
37
38
39

40

41
42

Application to 0/1 Knapsack

Problem
Traveling Salesman Problem
45
Efficiency Considerations
45
UNIT V NP COMPLETE PROBLEMS
Introduction
90
Basic Concepts
Nondeterministic Algorithms
Classes NP-Hard & NpComplete
Nondeterministic Turning Machine
45
Classes of P and NP
45
Cook;s Theorem
45
NP-Hard Graph Problems
90
Clique Decision Problem
Node Cover Decision Problem
Chromatic Number Decision
Problem
NP-Hard Graph Problems
90
Directed Hamiltonian Cycle
Traveling Salesperson Decision
Problem
AND/OR Graph Decision
Problem
NP-Completeness of the Satisfiability
45
Problem
Polynomial Space Bounded Problem
45

BB
BB/PPT

A, C
A, C

BB/PPT

A,D

BB
BB/PPT
BB
BB

B,
B,
A,
A,

C
C
B
B

BB

A, B

BB/PPT

A, C

BB

A, C