Data structures and algorithms in Java

Goodrich, Michael T.

Data structures and algorithms in Java Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser. - 6th ed. - New Delhi : Wiley, ©2015. - xviii, 699 p. : ill. ; 25 cm.

Includes bibliographical references and index.

Java primer -- Object-oriented design -- Fundamental data structures -- Algorithm analysis -- Recursion -- Stacks, queues, and deques -- List and iterator ADTs -- Trees -- Priority queues -- Maps, hash tables, and skip lists -- Search trees -- Sorting and selection -- Text processing -- Graph algorithms -- Memory management and B-trees.

"The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich, Tomassia and Goldwasser's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces. The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework"--Publisher's website.

9788126551903

2014412891

016708123 Uk


Java (Computer program language)
Data structures (Computer science)
Computer algorithms.

QA76.73.J38 / G66 2014

005.73 / GOO-D
© 2024 IIIT-Delhi, library@iiitd.ac.in