Normal view MARC view ISBD view

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

By: Neapolitan, Richard E.
Contributor(s): Naimipour, Kumarss [(j.a.)] | Neapolitan, Richard E. Foundations of algorithms.
Publisher: Sudbury, Mass. : Jones and Bartlett Publishers, c1998Edition: 2nd ed.Description: xv, 523 p. : ill. ; 25 cm.ISBN: 0763706205 (hbk); 9780763706203 (hbk.).Subject(s): Algorithms | Computational complexity | Constructive mathematicsDDC classification: 005.1
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.
Item type Current location Call number Copy number Status Notes Date due Barcode
Main Collection Taylor's Library-TU
005.1 NEA (Browse shelf) 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