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, Bi-
connected  components  and  depth-first  search.  Breadth  Search,  Back  Tracking
General  method  of  8-queens  problem,  Sum  of  subsets,  Graph  coloring,  Hamilton
cycles, Knapsack problem.