Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
83 views

CS6101 Design and Analysis of Computer Algorithms Syllabus

This document outlines the modules of the course CS 6101 Design and Analysis of Computer Algorithms. The modules cover basic algorithm design techniques like divide-and-conquer, greedy methods, dynamic programming, backtracking, and branch and bound. Module VII introduces NP-hard and NP-complete problems and the complexity classes P and NP. The document also lists recommended textbooks and reference books for the course.

Uploaded by

codejaxx
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
83 views

CS6101 Design and Analysis of Computer Algorithms Syllabus

This document outlines the modules of the course CS 6101 Design and Analysis of Computer Algorithms. The modules cover basic algorithm design techniques like divide-and-conquer, greedy methods, dynamic programming, backtracking, and branch and bound. Module VII introduces NP-hard and NP-complete problems and the complexity classes P and NP. The document also lists recommended textbooks and reference books for the course.

Uploaded by

codejaxx
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

CS 6101 DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS

MODULE -I
Basic Tools on Designing Algorithms : What is an algorithm ? Algorithm specification and performance analysis,
randomized algorithms.

MODULE –II
Divide-and-Conquer : The general method, application to binary search, finding the maximum and minimum,
merge sort, quick sort, the problem of selection and Strassen's matrix multiplication.

MODULE -III
The Greedy Method : The general method, application to optimal storage on tapes, job sequencing with
deadlines, optimal merge patterns and minimum weight spanning trees.
MODULE –IV & V
Dynamic Programming : The general method, application to multistage graphs, all pairs shortest paths,
optimal binary search trees,0/1-Knapsack and traveling salesman problem, Flow shop scheduling
Backtracking : The general method, application to 8- puzzle problem, 8- queen problem and sum of subsets.

MODULE -VI
Branch and Bound : The method, application to 0/1 Knapsack traveling salesman problems, and efficiency
considerations.

MODULE -VII
NP-Hard and NP-Complete Problems : Introduction and basic concepts, non-deterministic turing machine, the
classes of P and NP, NP-hard graph problems, NP- completeness of the satisfiability problem, and
polynomial- space-bounded problem.

Text Book :
1. E. Horowitz. et.al., Fundamentals of computer Algorithms, Galgotia Publication Pvt. Ltd., New Delhi,
2004

Reference Books :
1. J.Kleinberg & E. Tardos – Algorithm Design, Pearson Education, New Delhi, 2006
2. G.Brassard & P. Bratley – Fundamentals of Algorithms, PHI, New Delhi, 2005
3. T.H. Cormen et.al. – Introduction to Algorithms – PHI, New Delhi, 2005
4. S.Dasgupta et.al. – Algorithms, TMH, New Delhi - 2007

You might also like