Amazon cover image
Image from Amazon.com

Data structures and abstractions with JavaTM / Frank M. Carrano and Timothy M. Henry

By: Contributor(s): Material type: TextTextPublication details: Harlow, Essex, England : Pearson Education Limited, c2015Edition: Fourth editionDescription: xxviii, 897 pages : illustrations ; 26 cmISBN:
  • 9780133744057
Subject(s): LOC classification:
  • QA 76.9.D33 .C37 2015
Contents:
Introduction: organizing data -- 1. Bags -- 2. Bag implementations that use arrays -- 3. A bag implementation that links data -- 4.The efficiency of algorithms -- 5.Stacks -- 6.Stack implementations -- 7. Recursion -- 8. An introduction to sorting -- 9. Faster sorting methods -- 10.Queues, deques, and priority queues -- 11. Queue, deque, and priority queue implementations -- 12. Lists -- 13. A list implementation that uses an array -- 14. A list implementation that links data -- 15. Iterators for the ADT list -- 16. Sorted lists -- 17. Inheritance and lists -- 18. Searching -- 19. Dictionaries -- 20. Dictionary implementations -- 21.Introducing hashing -- 22. Hashing as a dictionary implementation -- 23.Trees -- 24. Tree implementations -- 25. A binary search tree implementation -- 26. A heap implementation -- 27. Balanced search trees -- 28. Graphs -- 29. Graph implementations.
Summary: Data Structures and Abstractions with Java is suitable for one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. This book is also useful for programmers and software engineers interested in learning more about data structures and abstractions. This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters — each with pedagogical tools to help students master each concept. Using the latest features of Java, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Graduate Studies General Circulation Gen. Ed. - CCIT GC QA 76.9.D33 .C37 2015 c.1 (Browse shelf(Opens below)) c.1 Available NULIB000009228
Books Books National University - Manila LRC - Main General Circulation Computer Science GC QA 76.9.D33 .C37 2015 c.2 (Browse shelf(Opens below)) c.2 Available NULIB000011016
Books Books National University - Manila LRC - Main General Circulation Gen. Ed. - CCIT GC QA 76.9.D33 .C37 2015 c.3 (Browse shelf(Opens below)) c.3 Available NULIB000011017
Browsing LRC - Graduate Studies shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)
GC QA 76.9.C643 .H36 2012 c.1 Computer organization and embedded systems / GC QA 76.9.C643 .J56 2014 c.3 Computer organization : principles, analysis, and design / GC QA 76.9.C643 .P38 2014 c.1 Computer organization and design : the hardware/software interface / GC QA 76.9.D33 .C37 2015 c.1 Data structures and abstractions with JavaTM / GC QA 76.9.D35 .B84 2013 Data structures using Java / GC QA 76.9.D38 .H36 2012 Data mining : concepts and techniques / GC QA 76.9.D343 .C53 2015 Data mining algorithms explained using R /

Introduction: organizing data -- 1. Bags -- 2. Bag implementations that use arrays -- 3. A bag implementation that links data -- 4.The efficiency of algorithms -- 5.Stacks -- 6.Stack implementations -- 7. Recursion -- 8. An introduction to sorting -- 9. Faster sorting methods -- 10.Queues, deques, and priority queues -- 11. Queue, deque, and priority queue implementations -- 12. Lists -- 13. A list implementation that uses an array -- 14. A list implementation that links data -- 15. Iterators for the ADT list -- 16. Sorted lists -- 17. Inheritance and lists -- 18. Searching -- 19. Dictionaries -- 20. Dictionary implementations -- 21.Introducing hashing -- 22. Hashing as a dictionary implementation -- 23.Trees -- 24. Tree implementations -- 25. A binary search tree implementation -- 26. A heap implementation -- 27. Balanced search trees -- 28. Graphs -- 29. Graph implementations.

Data Structures and Abstractions with Java is suitable for one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. This book is also useful for programmers and software engineers interested in learning more about data structures and abstractions. This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters — each with pedagogical tools to help students master each concept. Using the latest features of Java, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.

There are no comments on this title.

to post a comment.