CS-205 ANALYSIS & DESIGN OF L T P Cr ALGORITHMS 5 1 0 4 OBJECTIVE To relay the theoretical and practical aspects of design of algorithms PRE-REQUISITES

Knowledge of fundamentals of basic computer programming for implementing algorithms 1. BRIEF REVIEW: Graphs, sets and disjoint sets; union, sorting and searching algorithms and their analysis in terms of space and time complexity. 2. DIVIDE AND CONQUER: General method; binary search; merge sort; quick sort; selection sort; Strassens matrix multiplication algorithms and analysis of algorithms for these problems. 3. GREEDY METHOD: General method; knapsack problem, job sequencing with deadlines; minimum spanning trees; single source paths and analysis of these problems. 4. DYNAMIC PROGRAMMING: General method; optimal binary search trees; O/I knapsack; the traveling salesperson problem. 5. BACK TRACKING: General method; 8 queens problem; graph colouring; Hamiltonian cycles; analysis of these problems. 6. BRANCH AND BOUND: Method; O/I knapsack and traveling salesperson problem; efficiency considerations; Techniques for algebraic problems; some lower bounds on parallel computations. 7. NP HARD AND NP COMPLETE PROBLEMS: Basic concepts; Cooks theorem; NP hard graph and NP scheduling problems; some simplified NP hard problems. TEXT BOOK Horowitz Ellis and Sahni Sartaj, Fundamental of Computer Algorithms, Galgotia Publications, 1978 REFERENCE BOOKS 1. Cormen Thomas H., Leiserson Charles E. and Rivest Ronald L., Introduction to Algorithms, Tata McGraw Hill, 1990 2. Aho A. V. and Hopcroft J. E., The Design and Analysis of Computer Algorithm, Addison Wesley, 1974 3. Berlion P., and Bizard P., Algorithms The Construction, Proof and Analysis of Programs, John Wiley & Sons, 1986.

4. Bentley J. L., Writing Efficient Programs, Prentice Hall of India, June 1982. 5. Goodman S. E. and Hedetnieni, Introduction to Design and Analysis of Algorithm, McGraw Hill 6. Trembley Jean Paul and Bunt Richard B., Introduction to Computers Science - An Algorithms Approach, Tata McGraw Hill, 2002 7. Knuth Donald E., Fundamentals of Algorithms:The Art of Computer Programming, Vol. l, Naresh Publications, 1985 8. Goodrich Michael T. and Roberto Tamassia, Algorithm Design: Foundations, Analysis & Internet Examples, Wiley Student Ed., 2002 WEB REFERENCES 1. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html 2. http://www.fib.upc.edu/en/infoAca/estudis/assignatures/ADA.html 3. http://algo.inria.fr/AofA/ http://www.4shared.com/file/3ot7bZsV/Bentley_J_Writing_efficient_pr.html? refurl=d1url