Back to home page
|Listed in category:
|
Add to Watchlist

Picture 1 of 1

Data Structures Using Java, Moshe J. Augenstein, Yedidyah Langsam, Aaron M. Tene - Picture 1 of 1
Have one to sell?
Sell it yourself

Data Structures Using Java, Moshe J. Augenstein, Yedidyah Langsam, Aaron M. Tene

Condition:
Good
“.”
Price:
US $43.96
ApproximatelyEUR 40.42
Postage:
Free Economy Shipping. See detailsfor postage
Located in: Tucson, Arizona, United States
Delivery:
Estimated between Thu, 23 May and Tue, 28 May to 43230
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the delivery service selected, the seller's delivery history and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return postage. See details- for more information about returns
Payments:
    

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. 
Learn moreeBay Money Back Guarantee - opens new window or tab

Seller information

Registered as a business seller
Report this item - opens in new window or tab
Seller assumes all responsibility for this listing.
eBay item number:186166785332
Last updated on 18 Mar, 2024 01:55:00 GMTView all revisionsView all revisions

Item specifics

Condition
Good
A book that has been read, but is in good condition. Minimal damage to the book cover eg. scuff marks, but no holes or tears. If this is a hard cover, the dust jacket may be missing. Binding has minimal wear. The majority of pages are undamaged with some creasing or tearing, and pencil underlining of text, but this is minimal. No highlighting of text, no writing in the margins, and no missing pages. See the seller’s listing for full details and description of any imperfections. See all condition definitionsopens in a new window or tab
Seller notes
“.”
ISBN
9780130477217
Publication Year
2003
Type
Textbook
Format
Trade Paperback
Language
English
Publication Name
Data Structures Using Java
Item Height
3.9in
Author
Yedidyah Langsam, Aaron M. Tenenbaum, Moshe J. Augenstein
Item Length
3.9in
Publisher
Prentice Hall PTR
Item Width
3.9in
Item Weight
3.5 Oz
Number of Pages
688 Pages

About this product

Product Information

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.

Product Identifiers

Publisher
Prentice Hall PTR
ISBN-10
0130477214
ISBN-13
9780130477217
eBay Product ID (ePID)
2301245

Product Key Features

Author
Yedidyah Langsam, Aaron M. Tenenbaum, Moshe J. Augenstein
Publication Name
Data Structures Using Java
Format
Trade Paperback
Language
English
Publication Year
2003
Type
Textbook
Number of Pages
688 Pages

Dimensions

Item Length
3.9in
Item Height
3.9in
Item Width
3.9in
Item Weight
3.5 Oz

Additional Product Features

Lc Classification Number
Qa76.73.J38l358 2003
Table of Content
1. Introduction To Data Structures. Information and Meaning. Arrays, Strings, and Vectors in Java. Classes and Objects in Java. 2. The Stack. Definitions and Examples. Representing Stacks in Java. Example: Infix, Postfix and Prefix. Stack of Objects of Varying Types. 3. Recursion. Recursive Definition and Processes. Recursion in Java. Writing Recursive Programs. Simulating Recursion. Efficiency of Recursion. 4. 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. 5. Trees. Binary Trees. Binary Tree Representations. An Example: The Huffman Algorithm. Representing Lists as Binary Trees. Trees and Their Applications. Example: Game Trees. 6. Sorting. General Background. Exchange Sorts. Selection and Tree Sorting. Insertion Sorts. Merge and Radix Sorts. 7. Searching. Basic Search Techniques. Tree Searching. General Search Trees. Hashing. 8. Graphs and Their Applications. Graphs. Flow Problem. Links Representation of Graphs. Graph Traversal and Spanning Forests. 9. Storage Management. General Lists. Automatic List Management. Dynamic Memory Management.
Copyright Date
2003
Target Audience
College Audience
Topic
Programming / General, Programming Languages / Java
Lccn
2003-545061
Dewey Decimal
005.13/3
Dewey Edition
22
Illustrated
Yes
Genre
Computers

Item description from the seller

Intergalactic Books and More

Intergalactic Books and More

99.4% positive Feedback
295K items sold
Visit ShopContact

Detailed seller ratings

Average for the last 12 months

Accurate description
4.9
Reasonable postage cost
5.0
Delivery time
5.0
Communication
5.0
Registered as a business seller

Seller Feedback (123,539)

-***e (10)- Feedback left by buyer.
Past month
Verified purchase
Great
The House at the End of the World, Koontz, Dean, Good Book (#204589074451)
z***h (10)- Feedback left by buyer.
Past month
Verified purchase
<3
The Poison (Deluxe Edition), Bullet for My Valentine, Good Explicit Lyrics (#176321633785)
r***e (99)- Feedback left by buyer.
Past month
Verified purchase
A+
Earth A.D./Die Die My Darling, Misfits, Good (#204670563716)
See all Feedback

More to explore: