Practical Guide to Data Structures and Algorithms using Java

Regular price €127.99
Quantity:
Ships in 10-20 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
A01=Kenneth. J Goldman
A01=Sally. A Goldman
abstract data types
ADT
algorithm analysis
algorithms
asymptotic
Asymptotic Time Complexities
Author_Kenneth. J Goldman
Author_Sally. A Goldman
Binary Search Tree
Branch Position
Category=PB
Compact Trie
complexity
Compressed Trie
computational complexity
correctness
Correctness Highlights
Data structures
decision tree methodology
design patterns
efficient data structure selection
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Frontier Node
Goldman
graph algorithms
Heap Node
highlights
instance
Int Capacity
Internal Node
iteration
Iteration Order
Java
Leaf Node
Leftist Heap
object-oriented design
order
Pairing Heap
Positional Collection
Priority Queue
public
Public Boolean
Public Void
rderedC Ollection
Red Black Tree
Search Path
software development
software engineering education
time
Trie Node
Underlying Array
Union Find Data Structure
variable

Product details

  • ISBN 9781584884552
  • Weight: 2380g
  • Dimensions: 178 x 254mm
  • Publication Date: 23 Aug 2007
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns

Although traditional texts present isolated algorithms and data structures, they do not provide a unifying structure and offer little guidance on how to appropriately select among them. Furthermore, these texts furnish little, if any, source code and leave many of the more difficult aspects of the implementation as exercises. A fresh alternative to conventional data structures and algorithms books, A Practical Guide to Data Structures and Algorithms using Java presents comprehensive coverage of fundamental data structures and algorithms in a unifying framework with full implementation details. Recognizing that software development is a top-down process, this applications-centered book provides careful guidance to students and practitioners.

Complete and thoroughly integrated Java implementations expose key differences among a wide range of important data structures, including many useful abstract data types not provided in standard Java libraries. Fundamental algorithms appear within the context of their supporting data structures. Case studies, examples, decision trees, and comparison charts throughout the stylized presentation illustrate and support an efficient methodology for the careful selection and application of data structures and algorithms. Appendices summarize major features of the Java programming language, introduce asymptotic notation and complexity analysis, and discuss design patterns applied in the book.

A true marriage of theory and practice, this book sets a new standard as a comprehensive practical guide to data structures and algorithms. Practitioners and students will reach for this book often to quickly identify the best data structure or algorithm for their applications.

Sally. A Goldman, Kenneth. J Goldman

More from this author