PTU Syllabus | CS – 307 DESIGN AND ANALYSIS OF ALGORITHMS
CS – 307 DESIGN AND ANALYSIS OF ALGORITHMS
PREREQUISITES: Discrete Structures and Data Structures.
OBJECTIVES:
Date Structures are an integral part of algorithm design and Discrete Structures covers topics like graph theory.
COURSE CONTENTS:
Models of computation. Algorithm analysis, order arithmetic, time and space complexities and average and worst case analysis, lower bounds. [L-8]
Algorithm design techniques: divide and conquer, search and traversals. Dynamic programming. Backtracking. Branch and bound. [L-16]
Sorting and searching algorithms, combinatorial algorithms, string processing algorithms. Algebraic algorithms, set algorithms. Hard problems and approximation algorithms. [L-12]
Problem classes P, NP, NP-hard and NP-complete, deterministic and non deterministic polynomial time algorithms., Approximation algorithms for some NP-complete problems.
[L-6]
TEXT BOOKS
1.V. Aho, J.E.Hopcroft, J.D. Ullman, design and Analysis of Algorithms, Addison
Wesley, 1976.
2.Horowitz, S. Sahni, Fundamentals of Computer Algorithms, Galgotia Publishers, 1984.
REFERENCES:
1. D.E.Knuth, The Art of Computer Programming, Vols. 1 and 3, Addison Wesley, 1968,1975.
2. K.Mehlhorn, Data Structures and Algorithms, Vols. 1 and 2, Springer Verlag, 1984.
3. Purdom, Jr.and C. A. Brown, The Analyses of Algorithms, Holt Rinechart and Winston, 1985.
Related posts:
- CSE -305 E Analysis and Design of Algorithms
- PTU Syllabus | CS-207 DATA STRUCTURES & PROGRAMMING METHODOLOGY
- CSE-201 E Data Structures & Algorithms
- PTU Syllabus | CS – 301 SYSTEM ANALYSIS AND DESIGN
- PTU Syllabus | CS – 309 COMPUTER GRAPHICS