Data Structures Using Java

Name: Data Structures Using Java
Price: 43.47 USD
Availability: InStock
ISBN: 9780130477217

ISBN-10: 0130477214

ISBN-13: 9780130477217

Edition: 2003

Authors: Moshe J. Augenstein, Yedidyah Langsam, Aaron M. Tenenbaum

List price: $190.80

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $43.47

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

For a two-semester introductory level course in data structures and programming. Based on the firm conviction that a first course in data structures must go hand in hand with a second course in programming, this text introduces abstract concepts, shows how those concepts are useful in problem solving, and then shows the abstractions can be made concrete by using a programming language. Equal emphasis is placed on both the abstract and the concrete versions of a concept, so that the student learns about the concept itself, its implementation, and its application.

Book details

List price: $190.80
Copyright year: 2003
Publisher: Prentice Hall PTR
Publication date: 3/5/2003
Binding: Paperback
Pages: 688
Size: 7.00" wide x 9.25" long x 1.25" tall
Weight: 2.486
Language: English




Introduction To Data Structures


Information and Meaning. Arrays, Strings, and Vectors in Java. Classes and Objects in Java



The Stack


Definitions and Examples


Representing Stacks in Java


Example: Infix, Postfix and Prefix


Stack of Objects of Varying Types



Recursion


Recursive Definition and Processes


Recursion in Java


Writing Recursive Programs


Simulating Recursion


Efficiency of Recursion



Queues and Lists


The Queue and Its Sequential Representation


Linked Lists. Lists in Java


Lists in Java


An Example: Simulation Using Linked Lists


Other List Structures



Trees


Binary Trees


Binary Tree Representations


An Example: The Huffman Algorithm


Representing Lists as Binary Trees


Trees and Their Applications


Example: Game Trees



Sorting


General Background


Exchange Sorts


Selection and Tree Sorting


Insertion Sorts


Merge and Radix Sorts



Searching


Basic Search Techniques


Tree Searching


General Search Trees


Hashing



Graphs and Their Applications


Graphs


Flow Problem


Links Representation of Graphs


Graph Traversal and Spanning Forests



Storage Management


General Lists


Automatic List Management


Dynamic Memory Management