Sunday, 18 August 2013

Algorithm lecture Notes

C Lecture Notes

       click here

Algorithm lecture Notes


2)Topicwise Notes

  1. Introduction
  2. Mathematics for Algorithmic
  3. Greedy Algorithms
  4. Divide & Conquer Algorithms
  5. Dynamic Programming Algorithms
  6. Amortized Analysis
  7. Hash Table
  8. Binary Search Tree
  9. Graph Algorithms
  10. String Matching
  11. Sorting
  12. Linear-Time Sorting
  13. Computational Geometry
  14. Computational Complexity
  15. Approximate Algorithms
  16. Linear Programming
  17. Appendix
    1. Parabola
    2. Tangent
  18. Codes
  19. References