Taylor's Library Banner
Image from Google Jackets

Foundations of algorithms using C++ pseudocode / Richard E. Neapolitan, Kumarss Naimipour

By: Contributor(s): Publication details: Sudbury, Mass. : Jones and Bartlett Publishers, c1998Edition: 2nd edDescription: xv, 523 p. : ill. ; 25 cmISBN:
  • 0763706205 (hbk)
  • 9780763706203 (hbk.)
Subject(s): DDC classification:
  • 005.1 NEA
Contents:
Ch. 1. Algorithms : efficiency, analysis, and order. - Ch. 2. Divide-and-conquer. - Ch. 3. Dynamic programming. - Ch. 4. The greedy approach. - Ch. 5. Backtracking. - Ch. 6. Branch-and-bound. - Ch. 7. Introduction to computational complexity : the sorting problem. - Ch. 8. More computational complexity : the searching problem. - Ch. 9. Computational complexity and intractability : an introduction to the theory of NP. - Ch. 10. Introduction to parallel algorithms. - Appendix A : Review of necessary mathematics. - Appendix B. Solving recurrence equations : with applications to analysis of recursive algorithms. - Appendix C : Data structures for disjoint sets. - References. - Index.
Holdings
Cover image Item type Current library Home library Collection Shelving location Shelf location Call number Materials specified Vol info Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Main Collection Taylor's Library-TU

Floor 3, Shelf 1 , Side 2, TierNo 3, BayNo 5

 005.1 NEA (Browse shelf(Opens below)) 1 Available SOCIT,15010,03,GR 5000041956

Rev. ed. of : Foundations of algorithms. Lexington, Mass. : D.C. Heath, c1996.

Ch. 1. Algorithms : efficiency, analysis, and order. - Ch. 2. Divide-and-conquer. - Ch. 3. Dynamic programming. - Ch. 4. The greedy approach. - Ch. 5. Backtracking. - Ch. 6. Branch-and-bound. - Ch. 7. Introduction to computational complexity : the sorting problem. - Ch. 8. More computational complexity : the searching problem. - Ch. 9. Computational complexity and intractability : an introduction to the theory of NP. - Ch. 10. Introduction to parallel algorithms. - Appendix A : Review of necessary mathematics. - Appendix B. Solving recurrence equations : with applications to analysis of recursive algorithms. - Appendix C : Data structures for disjoint sets. - References. - Index.

Computer Science : ICS4U