Data structures & algorithms in Java Robert Lafore
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- 005.73 LAF
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
![]() |
CUTN Central Library Generalia | Non-fiction | 005.73 LAF (Browse shelf(Opens below)) | Available | 36672 | |
![]() |
CUTN Central Library Generalia | Non-fiction | 005.73 LAF (Browse shelf(Opens below)) | Available | 36670 | |
![]() |
CUTN Central Library Generalia | Non-fiction | 005.73 LAF (Browse shelf(Opens below)) | Available | 36671 |
Overview
Arrays
Simple Sorting
Stacks and Queues
Linked Lists
Recursion
Advanced Sorting.
Binary Trees.
Red-Black Trees.
2-3-4 Trees and External Storage.
Hash Tables.
Heaps.
Graphs.
Weighted Graphs.
When to Use What.
For this Second Edition, Lafore has rewritten each program to improve its operation, clarify the algorithms it illustrates, and reflect the latest versions of the Java 2 SDK. Lafore has also added brand-new questions and exercises at the end of every chapter. The result: students gain deep mastery over today's best practices and approaches for manipulating virtually any form of data with Java.
There are no comments on this title.