DESIGN & ANALYSIS OF ALGORITHMS

Course Code: B19CA3010 Total Credits: 4

Total Hrs.60 L: T: P –4:0:0

Course Objectives:
 Analyze the asymptotic performance, prove the correctness and analyze the running
time of the basic algorithms.
 Design algorithms using the dynamic programming, greedy method and recite
algorithms that employ this strategy.
 Demonstrate Tree and graph traversal techniques.
 Evaluation of Backtracking algorithms.

Course Outcomes:
On Successful Completion of the course, the students will be able to:
 Analyze the fundamental principles underlying algorithm analysis and design and
be able to apply them in specific instances
 Validate algorithms asymptotically and compute the performance analysis of
algorithms with the same functionality.
 Design an efficient algorithm and realize essentiality of the different techniques such as
divide-and conquer, dynamic programming and the greedy methods and many of its
applications
 Implement various algorithms on graph data structures, including finding the minimum
spanning tree and shortest path.

Course Content:
UNIT 1: [15 Hours]
Introduction and Divide & Conquer technique: Definition of algorithm, Characteristics of
algorithm, Important problem types, Fundamentals of Algorithmic Problem Solving using flow
chart, Different methods to find the GCD of two integers, Order of Growth, Basic efficiency
classes, Asymptotic Notations, Time and space complexity of an algorithms. Divide and
Conquer: General Method, Binary Search, Merge Sort and Quick Sort.

UNIT 2: [15 Hours]

Greedy M ethod: General method, Fractional Knapsack Problem, Job Sequencing with
deadline, Spanning trees, Minimum cost spanning trees: Prim’s algorithm, Kruskal’s
Algorithm, Single Source Shortest Paths problems-Dijkstra’s algorithm.
UNIT 3: [15 Hours]
Dynamic Programming: Introduction to Graphs, Types of graphs, Representation of graphs,
Terms related to graph, General Method, Multi stage Graphs, Warshall’s Algorithm for
Transitive Closure, All pair ShortestPaths,0/1–knapsack, Flow Shop Scheduling.

UNIT 4: [15 Hours]

Traversal techniques for Trees: Binary Tree, Properties of Binary Tree, Types of Binary Tree,
Binary Tree Traversal Techniques: Pre-order traversal, In-order traversal and post-order
traversal. Search techniques for graphs: Breadth First Search (BFS), Depth First Search (DFS).
Backtracking: General method, 4-Queens Problem, Sum of Subset Problem, Graph Coloring,
Hamiltonian Circuit Problem.

Text Books:

1. SaraBaase, Allen Van Gelder, “Computer Algorithms, Introduction to design and

rd
Analysis”, 3 edition Pearson Publication, 2006 (Chapters 4, 5, 7, 8 and 9).
2. Horowitz E, Sahani S, Rajasekharan S, “Fundamentals of Computer Algorithms”,
Galgotia Publication 2005(Chapters 1, 3- 6 and 7).
3. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer
algorithm”, 2005 (Chapters 1, 3, 4, 5, 6 and 7).

Reference Books:
1. A. M Padma Reddy, “Design and Analysis of Algorithms”, Sri nandi Publications,
2017(Chapters 1-9).
2. Srikanth S, “Design and Analysis of Algorithms”, Skyward Publishers, 2015 (Chapter 1-8).
3. Chitra Ravi, “Design and Analysis of Algorithms”, Subhas Publishers, 2015 (Chapter 1-8).