| 000 | 04049cam a2200397 a 4500 | ||
|---|---|---|---|
| 999 |
_c9008 _d9008 |
||
| 001 | 16524253 | ||
| 005 | 20190508110459.0 | ||
| 008 | 101029s2012 maua 001 0 eng | ||
| 010 | _a 2010043038 | ||
| 020 | _a9781449613549 | ||
| 020 | _a1449613543 | ||
| 040 |
_aDLC _cDLC _dDLC _erda |
||
| 042 | _apcc | ||
| 050 | 0 | 0 |
_aQA76.64 _b.D35 2012 |
| 082 | 0 | 0 |
_a005.117 _222 _bD.N.O |
| 100 | 1 |
_aDale, Nell B., _eauthor. |
|
| 245 | 1 | 0 |
_aObject-oriented data structures using Java / _cNell Dale, Daniel T. Joyce, Chip Weems. |
| 250 | _athird edition | ||
| 264 | 1 |
_aSudbury, MA : _bJones & Bartlett Learning, _c[2012] |
|
| 264 | 4 | _cc2012. | |
| 300 |
_axxii, 799 pages : _billustration ; _c24 cm |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aunmediated _2rdamedia |
||
| 338 |
_avolume _2rdacarrier |
||
| 500 | _aIncludes index. | ||
| 505 | 0 | _aCh. 1. Getting organized. Software engineering ; Object orientation ; Classes, objects, and applications ; Organizing classes ; Data structures ; Basic structuring mechanisms ; Comparing algorithms : big-O analysis -- Ch. 2. Abstract data types. Abstraction ; The StringLog ADT specification ; Array-based StringLog ADT implementation ; Software testing ; Introduction to linked lists ; Linked list StringLog ADT implementation ; Software design : identification of classes ; Case study : a trivia game -- Ch. 3. The stack ADT. Stacks ; Collection elements ; Exceptional situations ; Formal specification ; Array-based implementations ; Application : well-formed expressions ; Link-based implementation ; Case study : postfix expression evaluator -- Ch. 4. Recursion. Recursive definitions, algorithms, and programs ; The three questions ; Towers of Hanoi ; Counting blobs ; Recursive linked-list processing ; Removing recursion ; Deciding whether to use a recursive solution -- Ch. 5. The queue ADT. Queues ; Formal specification ; Array-based implementations ; Application : palindromes ; Application : the card game of War ; Link-based implementations ; Concurrency, interference, and synchronization ; Case study : average waiting time -- Ch. 6. The list ADT. Comparing objects revisited ; Lists ; Formal specification ; Array-based implementations ; Applications : poker, golf, and music ; The binary search algorithm ; Reference-based implementations ; Storing objects and structures in files -- Ch. 7. More lists. Circular linked lists ; Doubly linked lists ; Linked lists with headers and trailers ; A linked list as an array of nodes ; A specialized list ADT ; Case study : large integers -- Ch. 8. Binary search trees. Trees ; The logical level ; The application level ; The implementation level : basics ; Iterative versus recursive method implementations ; The implementation level : remaining operations ; Comparing binary search tree and linear lists ; Balancing a binary search tree ; A nonlinked representation of binary trees ; Case study : word frequency generator -- Ch. 9. Priority queues. Priority queues ; Heaps ; Introduction to graphs ; Formal specification of graph ADT ; Implementations of graphs ; Graph applications -- Ch. 10. Sorting and searching algorithms. Sorting ; Simple sorts ; O(N logâ‚‚N) sorts ; More sorting considerations ; Searching ; Hashing -- Appendix A. Java reserved words -- Appendix B. Operator precedence -- Appendix C. Primitive data types -- Appendix D. ASCII subset of Unicode -- Appendix E. Application of programmer interfaces for the Java classes and interfaces used in this book. | |
| 650 | 0 | _aObject-oriented programming (Computer science) | |
| 650 | 0 | _aData structures (Computer science) | |
| 650 | 0 | _aJava (Computer program language) | |
| 700 | 1 |
_aJoyce, Daniel T. _eco-author. |
|
| 700 | 1 |
_aWeems, Chip, _eco-author. |
|
| 856 |
_3Abstract _uhttp://repository.fue.edu.eg/xmlui/handle/123456789/3593 |
||
| 906 |
_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg |
||
| 942 |
_2ddc _cBK |
||