Sri Chandrasekharendra Saraswathi Viswa Mahavidyalaya Department of Computer Science and Engineering
Page 64 of 162 Syllabus B.E[CSE] Full Time L T P C 3 2 0 3
CS4T4 - DESIGN AND ANALYSIS OF ALGORITHMS
(For Students admitted from 2014 onwards) PRE-REQUISITE:
Basic knowledge of Computer Programming.
AIM :
To study various algorithmic techniques and methods of analysis of algorithms OBJECTIVES:
1. To develop proficiency in problem solving and programming.
2. To be able to carry out the Analysis of various algorithms for mainly time and space complexity.
3. To develop a base for advanced study in Computer Science
OUTCOME:
After completion of the course the students are expected to be able to:
1. Design algorithms for various computing problems.
2. Analyze the time and space complexity of algorithms.
3. Analyze the different algorithm design techniques for a given problem.
4.
Modify existing algorithms to improve efficiency.
UNIT – I
Introduction – Notion of Algorithm – Fundamentals of Algorithmic Solving – Important Problem types – Fundamentals of the Analysis of Algorithm Efficiency-Analysis Framework – Asymptotic Notations and Basic Efficiency Classes. Mathematical Analysis of Non-recursive Algorithm – Mathematical Analysis of Recursive Algorithm – Example: Fibonacci Numbers , Tower of Hanoi
UNIT – II
Divide and conquer: General Method, Binary Search ,Finding the maximum and minimum, Merge sort, Quick sort, Strassen’s matrix multiplication
UNIT – III
The Greedy Method : General method, Fractional Knapsack problem, Job sequencing with deadlines, Minimum spanning trees, Single source shortest paths.
UNIT – IV
Dynamic programming: General method, Multistage graphs, All pairs shortest paths, Optimal binary search trees, 0/1 Knapsack, Travelling sales person problem.
UNIT – V
Back Tracking: General method, 8-Queens problem, Sum of subsets, Graph coloring, Hamiltonian cycles – Branch and Bound: General Methods (FIFO & LC) – 0/1 Knapsack problem - NP hard and NP complete Problems-Basic Concepts-Non deterministic Algorithms- The classes NP, NP Hard and NP Complete-definitions and examples.
Sri Chandrasekharendra Saraswathi Viswa Mahavidyalaya Department of Computer Science and Engineering
Page 65 of 162 Syllabus B.E[CSE] Full Time Note : Proofs of algorithms are not included in the syllabus
TEXT BOOKS
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Pearson Education Asia, 2nd Edition 2011 (For Unit I).
2. Ellis Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran – “Computer Algorithms/C++”, Second Edition, Universities Press, 2007 (For Unit II to V)
REFERENCE BOOK
1. Ellis Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran – “Fundamentals of Computer Algorithms ” – W.H. Freeman and Co,2002.
