SUBJECT: Designing and Analysis of Algorithms

Introduction and analysis of algorithms, Elementary data Structures. Arrays, Linked list, Stacks and Queues, Trees, Heaps and Heapsorts, Set and disjoint set union, Graphs, Hashing. Divide And Conquer General method, Binary search, Finding the maximum and minimum, Merge sort, Quick sort, Selection sort, Strassen s matrix multiplication. The Greedy Method, General method, Optimal storage on tapes, Knap sack problem, Job sequencing with deadlines, Optimal merge patterns, Minimum spanning trees, Single source shortage path. Basic Search And Traversal Techniques The techniques of code optimization, AND/OR graphs, Game trees, Biconnected components and depth-first search. Breadth Search, Back Tracking General method of 8-queens problem, Sum of subsets, Graph coloring, Hamilton cycles, Knapsack problem.

Reference
Knuth 'Fundamentals of Algorithms   (Narosa Publication)
CMA by Tanenbaum Kruse,Leung,Tondo,  Data structures and Program Design in C , Prentice Hall, 1991. Writh,  
Algorithms + Data Structures = Programmes , Prentice Hall Aho,Hopcroft, Ullman,  Data Structures and Algorithms , Addison-Wesley. Horowitz, Sahni,  
Fundamentals of Data Structures, Computer Science Press.
Fundamentals of Computer Algorithms, Ellis
Introduction to algorithms, Thomas Corman, R Ronald, PHI
How to solve by Computers, R. G. Bromei, PHI
Mastering Algorithms with C, Kyle Loudon, O  Reilly
Digital Logic, John M Yarbrough, Brooks/cole, Thompson Learning

Term Work
Should contain at least 10 assignments covering the syllabus

Tutorial
Tutorial should contain 5 assignments

Practical None