Taylor's Library

Normal view MARC view ISBD view

Practical algorithms in C++ / Bryan Flamig

By: FLAMIG, Bryan.
Publisher: N.Y : John Wiley, c1995Description: xvii, 445 p. ; 24 cm.ISBN: 0471009555.Subject(s): C++ (Computer program language) | Computer algorithmsDDC classification: 005.133
Contents:
Preface. - Ch. 1. Basic Concepts. - Ch. 2. Algorithm Construction in C++. - Ch. 3. Algorithmic Generators. - Ch. 4. Primes, Factors, and Permutations. - Ch. 5. Linear Congruential Generators. - Ch. 6. Random Combinations and Permutations. - Ch. 7. Hashing Algorithms. - Ch. 8. Heaps. - Ch. 9. Basic Sorting Algorithms. - Ch. 10. More Sorting Algorithms. - Ch. 11. Text Searching. - Ch. 12. Shift-OR Text Searching. - Ch. 13. Graph Data Structures. - Ch. 14. Basic Graph Traversals. - Ch. 15. Graph Minimization Algorithms. - Ch. 16. Finite State Machines. - Bibliography. - Index.
Summary: This book presents algorithms from a practical point of view, clearly explaining how the algorithms work, as well as fully implementing them in C++. Written to the intermediate C++ programmer, this book covers a wide range of subjects, from sorting and searching algorithms, to graph traversal algorithms, hashing algorithms, piority queues, finite state machines, and "algorithmic generators," a unique, object-oriented way of implementing algorithms. - Back cover.
Item type Current location Shelf location Call number Vol info Copy number Status Notes Date due Barcode Remark
Main Collection Taylor's Library-TU

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

 005.133 FLA (Browse shelf) 1 Available SOCIT,15008,03,GR 5000041173
Main Collection TU External Storage-LCS
005.133 FLA (Browse shelf) 1 Available SOCIT,15008,03,GR 1000104363 Please fill up online form at https://taylorslibrary.taylors.edu.my/services/external_storage1
Accompanying Material (Media Resource) Taylor's Library-TU
005.133 FLA (Browse shelf) COMPUTER DISK 1 Available SOCIT,15008,03,GR 1000104356
Accompanying Material (Media Resource) Taylor's Library-TU
005.133 FLA (Browse shelf) COMPUTER DISK 1 Available SOCIT,15008,03,GR 1000104355

Preface. - Ch. 1. Basic Concepts. - Ch. 2. Algorithm Construction in C++. - Ch. 3. Algorithmic Generators. - Ch. 4. Primes, Factors, and Permutations. - Ch. 5. Linear Congruential Generators. - Ch. 6. Random Combinations and Permutations. - Ch. 7. Hashing Algorithms. - Ch. 8. Heaps. - Ch. 9. Basic Sorting Algorithms. - Ch. 10. More Sorting Algorithms. - Ch. 11. Text Searching. - Ch. 12. Shift-OR Text Searching. - Ch. 13. Graph Data Structures. - Ch. 14. Basic Graph Traversals. - Ch. 15. Graph Minimization Algorithms. - Ch. 16. Finite State Machines. - Bibliography. - Index.

This book presents algorithms from a practical point of view, clearly explaining how the algorithms work, as well as fully implementing them in C++. Written to the intermediate C++ programmer, this book covers a wide range of subjects, from sorting and searching algorithms, to graph traversal algorithms, hashing algorithms, piority queues, finite state machines, and "algorithmic generators," a unique, object-oriented way of implementing algorithms. - Back cover.

Accompanied by : 1 computer disk (3 1/2 in.)