Presentations slides

  1.  Introduction
  2.  Code tuning
  3.  Math and Logic
  4.  Algorithm Complexity
  5.  Linear Data Strucutres
  6.  Sorting Techniques
  7.  Amortized Anlaysis And Master Method
  8.  More Sorting
  9.  Trees
  10.  Graphs
  11.  Hashing
  12.  Work on the problem not the code
  13.  Divide and Conquer
  14.  Greedy Programming
  15.  AVL Trees
  16.  Skip lIsts
  17.  Red Black Trees
  18.  B Trees
  19.  Tries
  20.  MST Prim Kruskal
  21.  Disjoint Set Union Find
  22.  Binomial and Fibonacci Heaps
  23.  Splay Trees
  24.  Augmenting Data Structures
  25.  String Matching
  26.  Dynamic Programming
  27.  Backtracking
  28.  Branch and Bound
  29.  Shortest Path Problems
  30.  N NP NPComplete and Reductions
  31.  Max Flow problems
  32.  Geometric Algorithms
  33.  Approximation Algorithms
  34.  Cache Aware Algorithms
  35.  Online Algorithms
  36.  Randomized Algorithms
  37.  Facility Location Problems
  38.  Persistent and Retroactive Data Structures
  39.  Parallel Algorithms
  40.  Genetic Algorithms
  41.  Fast Fourier Transform Algorithms
  42.  Support Vector Machines
  43.  Clustering in Data Mining
  44.  Applications of Data Structures and Algorithms Infosys
  45.  How to do Research
  46.  Brain Storming