| Description |
xxii, 736 p. : ill. ; 24 cm. |
| Bibliography |
Includes bibliographical references (p. 725-726) and index. |
| Contents |
Introduction to Java -- Object-oriented concepts -- Additional features of programming ad Java -- Analysis of algorithms -- The Java collections framework -- Recursion -- Array-based lists -- Linked lists -- Stacks and queues -- Binary trees -- Binary search trees -- Sorting -- Tree maps and tree sets -- Priority queues -- Hashing -- Graphs, trees and networks -- Additional features of the Java collections framework -- Mathematical background -- Choosing a data structure. |
| Summary |
"Instead of emphasizing the underlying mathematics to get programmers to build their own data structures, Collins enables them to manipulate existing structures in the Java Collections Library. This allows them to learn through coding rather than by doing proofs. 23 lab projects and hundreds of programming examples are integrated throughout the pages to build their intuition. The approach this book takes helps programmers quickly learn the concepts that underlie data structures." |
| Subject |
Java (Computer program language)
|
|
Data structures (Computer science)
|
| ISBN |
9780470482674 |
|
