CHRIST UNIVERSITY

BANGALORE – 560029
Department of Computer Science (BCA)
Course Plan

Class : IV semester BCA

Subject code : BCA435
Subject : Analysis & Design Of Algorithms
Teaching Hours : 45
Text Book : Horowitz, Sahni, Rajasekaran, “Fundamentals of Computer
Algorithms.” Universities Press Pvt Ltd, 2008.
Faculty : NAGENDRA. N ; email : nagendra.n@christuniversity.in.
Unit Content Completion Assignment /
Date Test / Exam

INTRODUCTION: A simple example of design using 8/11/10 to

1 insertion sort, pseudo code for insertion sort and analysis of 25/11/10
time complexity. Performance Analysis – Space complexity
and Time complexity (posteriori testing, and apriori
approach), Asymptotic Notations (O, Ω, Θ). Polynomial vs.
Exponential Algorithms. Average, Best and Worst case
complexity.

DIVIDE AND CONQUER ALGORITHMS : Introduction 26/11/10 I Assignment /

2 to Divide and Conquer Algorithms - Finding the Maximum 15/12/10 Test
and Minimum, Quicksort (Derivation of Average case (20 Marks)
analysis and Worst case analysis), Binary Search (Derivation
of average case analysis), and Strassen’s Matrix
Multiplication

GREEDY ALGORITHMS :Introduction to Greedy

3 Algorithms - Fractional Knapsack problem, Minimum cost 16/12/2010 to
spanning trees Kruskal’s and Prim’s Algorithms, Optimal 09/01/11
Merge patterns and Single-Source Shortest Paths
DYNAMIC PROGRAMMING : Definition - All-pairs 11/01/11 to Mid-Sem
4 shortest paths, Traveling salesman problem and optimal 31/01/11 Examination
parameterization for product of sequence of matrices (50 Marks)

BACK TRACKING AND BRANCH AND BOUND 01/02/11 to

5 ALGORITHMS : Introduction - N-Queens Problem, Sum 12/02/10
of Subsets problem using Back tracking algorithms.
Traveling Salesman problem using branch and bound method

GRAPHS AND HEAPS 14/02/11 to II Assignment

6 Definitions – Adjacency Matrix, Adjacency Lists. Breadth 28/02/11 (20 Marks)
First Search and Traversal, Depth First Search and Traversal.
Priority Queues using Heap and Design of Heap sort using
Priority Queues
 LOWER BOUND THEORY 01/03/11 to
7 A brief introduction to comparison trees and NP hard and NP 12/03/11
complete problems

Reference Books :

1. Donald E. Knuth, “The Art of Computer Programming” Volume 3, Sorting and

Searching, Second Edition, Pearson Education

2. Donald E. Knuth, “The Art of Computer Programming” Volume 1, fundamental

algorithms, Third Edition, Pearson Education

3. GAV PAI, “Data structures and Algorithms”, Tata McGraw Hill

4. Richard F. Gilberg, Behrouz A, Forouzan “Data structures A Pseudocode approach

with C”

&&&&&&&&&&&&&&&&