ANNAMACHARYA INSTITUTE OF TECHNOLOGY & SCIENCES::RAJAMPET

(AN AUTONOMOUS INSTITUTION)

Second Semester MCA
20DF2GT -DESIGN & ANALYSIS OF ALGORITHMS
(Elective II)
COURSE OBJECTIVES
 To teach paradigms and approaches used to analyze and design algorithms and to appreciate
the impact of algorithm design in practice.
 To make students understand how the worst-case time complexity of an algorithm is defined,
how asymptotic notation is used to provide a rough classification of algorithms.
 To teach various advanced design and analysis techniques such as greedy algorithms,
dynamic programming & Know the concepts of tractable and intractable problems and the
classes P, NP and NP-complete problems.

UNIT I
INTRODUCTION: Notion of Algorithm - Fundamentals of algorithmic problem solving – Important
problem types – Fundamentals of the analysis of algorithm efficiency – analysis frame work –
Asymptotic Notations - Recurrence equations – Solving recurrence equations –Analysis of linear
search- Recursive solution to the Tower of Hanoi Puzzle

UNIT II
DIVIDE AND CONQUER: General Method, Merge sort, Quick sort, Binary search, Binary tree
traversals and related properties.

UNIT III
DYNAMIC PROGRAMMING: General Method – Multistage Graphs – All-Pair shortest paths –
Optimal binary search trees – 0/1 Knapsack – Travelling salesperson problem, Greedy Technique:
General Method, Prim’s algorithm, Kruskal’s algorithm, Single Source Shortest Paths- Dijkstra’s
algorithm.

UNIT IV
BACK TRACKING: General Method, 8-queen problem, sum of subsets problem, graph coloring,
Hamiltonian cycles, Branch and Bound: General Methods (FIFO & LC) – 0/1 Knapsack problem.

UNIT V ‘
NP- COMPLETENESS – NP-Hard and NP-Complete Problems: NP-Hard, NP-Complete Classes,
COOKS Theorem.

TEXT BOOKS:
1. T. H. Corman, C Leiserson, Rivest, Ronald and stein Clifford. Introduction to algorithms. MGH,
New York, 2001, 2nd Ed.
2. AnanyLevitin. Introduction to the design and analysis of algorithms. Pearson education, 2003,
2nd Ed.
3. Ellis Horowitz, SartajSahni and SanguthevarRajasekaran, Computer Algorithms/ C++, Second
Edition, Universities Press, 2007. (For Units II to V).
 REFERENCE BOOKS:
1. E Horowitz, S Sahni, S Rajasekaran, Fundamentals of computer algorithms. Universities press,
2008, 2nd Ed.
2. Richard Neopolitan, KumarssNaimipour, Foundations of algorithms using C++ pseudo code,
Jones and Bartlett Learning, 1998, 2nd Ed.
3. K.S. Easwarakumar, Object Oriented Data Structures using C++, Vikas
Publishing House pvt. Ltd., 2000 (For Unit I)

EXPECTED COURSE OUTCOMES

Blooms Level
Student’s will be able to of Learning

Students will be able to Analyze a given algorithm and express its

1: L1
time and space complexities in asymptotic notations.
Students will be able to design algorithms using Divide and
2: L3,L5
Conquer Strategy.
Students will be able to compare Dynamic Programming and Divide
3: L3,L4
and Conquer Strategies.
Students will be able to solve Optimization problems using Greedy
4: L2,14
strategy.
Students will be able to design efficient algorithms using Back
5: L3
Tracking and Branch Bound Techniques for solving problems.

CO-PO MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
20DF2GT-1 3 2 2 2 - 1 1 - - 2 - 1
20DF2GT-2 3 2 2 2 - - 1 - - 2 - 1
20DF2GT-3 3 2 2 2 - 1 1 - - 2 - 1
20DF2GT-4 3 2 2 2 - 1 - - - 2 - 1
20DF2GT-5 2 - 3 - 1 - - - - 2 - 1