| 000 | 03056cam a2200433 i 4500 | ||
|---|---|---|---|
| 999 |
_c200458699 _d76911 |
||
| 001 | 200458699 | ||
| 003 | TR-AnTOB | ||
| 005 | 20231024165335.0 | ||
| 007 | ta | ||
| 008 | 231024t20132013maua 001 0 eng | ||
| 010 | _a 2013372067 | ||
| 020 |
_a0273768417 _q(paperback) |
||
| 020 |
_a9780273768418 _q(paperback) |
||
| 035 | _a(TR-AnTOB)200458699 | ||
| 040 |
_aB9K _beng _erda _cB9K _dTR-AnTOB |
||
| 041 | 0 | _aeng | |
| 050 | 4 |
_aQA76.73.C153 _bC37 2013 |
|
| 090 |
_aQA76.73.C153 _bC37 2013 |
||
| 100 | 1 |
_aCarrano, Frank M. _eauthor _94564 |
|
| 245 | 1 | 0 |
_aData abstraction & problem solving with C++ : _bwalls and mirrors / _cFrank M. Carrano, Timothy Henry. |
| 246 | 3 | 0 | _aData abstraction and problem solving with C++ |
| 246 | 3 | 0 |
_aData abstraction & problem solving with C++ : _bwalls & mirrors |
| 250 | _aSixth edition. | ||
| 264 | 1 |
_aBoston : _bPearson, _c2013. |
|
| 264 | 4 | _c©2013 | |
| 300 |
_a833 pages : _billustrations (some color) ; _c26 cm |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_aunmediated _bn _2rdamedia |
||
| 338 |
_avolume _bnc _2rdacarrier |
||
| 500 | _aIncludes index. | ||
| 505 | _aChapter 1. Data abstraction: the walls -- C++ interlude 1. C++ classes -- Chapter 2. Recursion: the mirrors -- Chapter 3. Array-based implementation -- C++ interlude 2. Pointers, polymorphism, and memory allocation -- Chapter 4. Link-based implementations -- Chapter 5. Recursion as a problem-solving technique -- Chapter 6. Stacks -- C++ interlude 3. Exceptions -- Chapter 7. implementations of the ADT stack -- Chapter 8.Lists -- Chapter 9. List implementations -- Chapter 10. Algorithm efficiency -- Chapter 11. Sorting algorithms and their efficiency -- C++ interlude 4. Class relationships and reuse -- Chapter 12. Sorted lists and their implementations -- Chapter 13. Queues and priority queues -- Chapter 14. Queue and priority queue implementations -- C++ interlude 5. Overloaded operators and friend access -- Chapter 15. Trees -- Chapter 16. Tree implementations -- C++ interlude 6. Iterators -- Chapter 17. Heaps -- Chapter 18. Dictionaries and their implementations -- Chapter 19. Balanced search trees -- Chapter 20. Graphs -- Chapter 21. Processing data in external storage -- C++ interlude 7. The standard template library -- Appendix A. Review of c++ fundamentals -- Appendix B. Important themes in programming -- Appendix C. The unified modeling language -- AppendixD. The software life cycle -- Appendix E. Mathematical induction -- Appendix F. Algorithm verification -- Appendix G. Files -- Appendix H. C++ header files and standard functions -- Appendix I. C++ documentation systems -- Appendix J. ASCII character codes -- AppendixK. C++ for java programmers -- Appendix L. C++ for python programmers -- ındex. | ||
| 650 | 0 |
_aC++ (Computer program language) _91404 |
|
| 650 | 0 |
_aAbstract data types (Computer science) _9144106 |
|
| 650 | 0 |
_aProblem solving _xData processing _92316 |
|
| 700 | 1 |
_aHenry, Timothy _eauthor _9144107 |
|
| 942 |
_2lcc _cBK |
||