Algorithm Specification: Pseudocode Conventions – Recursive Algorithms – Performance Analysis: Space and Time complexity –Asymptotic Notation. Elementary Data Structures: Stacks and Queues – Trees – Priority Queues – Graphs.
General Method –Binary search – Finding the Maximum and minimum – Merge sort – Quick sort – Selection - Strassen’s Matrix Multiplicaton
General Method –Knapsack problem - Tree vertex splitting - Job sequencing with deadlines – Minimum cost spanning Trees: Prim’s Algorithm – Kruskal’s Algorithm- Optimal storage on tapes
The General Method - Multistage Graphs – All Pairs Shortest Paths – Single Source Shortest Paths - String Editing – 0/1 knapsack. Basic Traversal and Search Techniques: Techniques for Graphs.
The General Method – The 8-Queens Problem- Sum of Subsets - Graph Coloring – Hamiltonian Cycles. Branch and Bound: The Method: FIFO Branch-and-Bound-LC Branch-and-Bound. Traveling Salesperson
Reference Book:
(i) G. Brassard and P. Bratley, 1997, Fundamentals of Algorithms, PHI, New Delhi. A.V. Aho, J.E. Hopcroft, J.D. Ullmann, !974, The design and analysis of Computer Algorithms, Addison Wesley, Boston. S.E.Goodman and S.T.Hedetniemi, 1977, Introduction to the Design and Analysis of algorithms, Tata McGraw Hill Int. Edn, New Delhi.
Text Book:
Ellis. Horowitz, Sartaj. Sahni and Rajasekaran, Fundamentals of Computer Algorithms, Second Edition –Universities Press (India) Private Limited 2008.
