| 000 | 02621cam a2200469 a 4500 | ||
|---|---|---|---|
| 001 | ocm37004464 | ||
| 003 | OCoLC | ||
| 005 | 20211028114118.0 | ||
| 008 | 970522s1998 maua b 001 0 eng | ||
| 010 | _a 97022058 | ||
| 020 | _a020130564X | ||
| 020 | _a9780201305647 | ||
| 029 | 1 |
_aAU@ _b000013262547 |
|
| 029 | 1 |
_aAU@ _b000023298880 |
|
| 029 | 1 |
_aDEBBG _bBV011653055 |
|
| 029 | 1 |
_aDEBSZ _b065011864 |
|
| 029 | 1 |
_aHEBIS _b099464217 |
|
| 029 | 1 |
_aHEBIS _b12990855X |
|
| 029 | 1 |
_aHR0 _b020130564x |
|
| 029 | 1 |
_aNZ1 _b4855728 |
|
| 029 | 1 |
_aYDXCP _b1405183 |
|
| 035 |
_a(OCoLC)37004464 _z(OCoLC)1120805252 _z(OCoLC)1167062886 |
||
| 040 |
_aDLC _beng _cDLC _dUBA _dMUQ _dBAKER _dNLGGC _dYDXCP _dBTCTA _dOCLCG _dDEBBG _dZWZ _dOCLCO _dOCLCF _dOCLCQ _dEQF _dZ5A _dOCLCQ _dOCLCO _dDHA _dAPUMS _dOCLCQ _dCNO _dWLU _dOCLCO _dOCLCQ _dOCLCO _dOCLCQ _dIL4J6 _dOCLCO |
||
| 049 | _aAKDA | ||
| 082 | 0 | 0 |
_a005.7 _2Abridged edition. |
| 100 | 1 |
_aStandish, Thomas A., _d1941- _eauthor |
|
| 245 | 1 | 0 |
_aData structures in Java / _cThomas A. Standish. |
| 260 |
_aReading, Mass. : _bAddison-Wesley, _cc1998. |
||
| 300 |
_axvii, 555 pages : _billustrations (some color) ; _c25 cm |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_aunmediated _bn _2rdamedia |
||
| 338 |
_avolume _bnc _2rdacarrier |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 520 | 1 | _a"Using Java 1.1, Professor Thomas A. Standish brings the fundamentals of data structures and algorithms to a new light. Standish believes that Java offers the opportunity to take a fresh look at the subject matter. New languages bring with them new challenges, which the author is prepared to meet. For example, although Java is a language without explicit pointers, this book offers pointer diagrams to help students visualize, reason about, and understand this major data structures topic. Standish's clear presentation helps readers tie in the many concepts of data structures with recurring themes. Central ideas - such as modularity, levels of abstraction, efficiency, and tradeoffs - serve as integrators in the book in order to merge the material conceptually and to reveal its underlying unity and interrelationships."--Jacket. | |
| 650 | 0 | _aJava (Computer program language) | |
| 650 | 0 | _aData structures (Computer science) | |
| 650 | 6 | _aJava (Langage de programmation) | |
| 650 | 7 |
_aJava (Computer program language) _2fast _0(OCoLC)fst00982065 |
|
| 650 | 7 |
_aData structures (Computer science) _2nli |
|
| 776 | 0 | 8 |
_iOnline version: _aStandish, Thomas A., 1941- _tData structures in Java. _dReading, Mass. : Addison-Wesley, �1998 _w(OCoLC)696262434 |
| 942 |
_2ddc _cBKS |
||
| 999 |
_c45579 _d45579 |
||