Data Structures and Abstractions with Java

Inbunden, Engelska, 2018

2 999 kr

Slutsåld

A relatable and friendly introduction to data structures and their implementation

The 5th Edition of Data Structures and Abstractions with Java introduces readers to data structures (CS-2) in a supportive, reader-friendly way. The book’s organization, sequencing, and pace of topic coverage make teaching and learning easier by:

Focusing the reader’s attention on one concept at a time
Providing flexibility in the order in which one can cover topics
Clearly separating the specification of each abstract data type (ADT) from its implementation
Placing relevant coverage of Java into Java Interludes, which you can use as needed.

To increase readability and learning potential, the numbered segments and modular presentation provide a flexible, customizable pathway through the material and focus the reader’s attention on one concept at a time. Numerous examples that mimic real-world situations provide a context for the new material and help to make it easier for audiences to learn and retain abstract concepts. The 5th Edition has a revamped structure and additional pedagogical tools to assist in mastering concepts.

Produktinformation

Utgivningsdatum2018-03-08
Mått206 x 254 x 36 mm
Vikt1 724 g
FormatInbunden
SpråkEngelska
Antal sidor960
Upplaga5
FörlagPearson Education
ISBN9780134831695

Tillhör följande kategorier

Frank M. Carrano is Professor Emeritus of Computer Science at the University of Rhode Island. He received his Ph.D. degree in Computer Science from Syracuse University in 1969. His interests include data structures, computer science education, social issues in computing, and numerical computation. Professor Carrano is particularly interested in the design and delivery of undergraduate courses in computer science. He has authored several well-known computer science textbooks for undergraduates. Timothy M. Henry has a Bachelor of Science Degree in Mathematics from the U.S. Coast Guard Academy, a Master of Science Degree in Computer Science from Old Dominion University, and was awarded a PhD in Applied Math Sciences from the University of Rhode Island. He began his IT career as an officer in the U.S. Coast Guard, and among his early tours, he was the Information Resources Manager (what is today a CIO) at the Coast Guard's training centre in Yorktown, VA.

Introduction: Organizing DataPrelude: Designing Classes Bags Java Interlude 1 GenericsBag Implementations That Use Arrays Java Interlude 2 ExceptionsA Bag Implementation That Links DataThe Efficiency of AlgorithmsStacksStack Implementations Java Interlude 3 More About ExceptionsQueues, Deques, and Priority QueuesQueue, Deque, and Priority Queue ImplementationsRecursionListsA List Implementation That Uses an ArrayA List Implementation That Links Data Java Interlude 4 IteratorsIterators for the ADT ListProblem Solving With Recursion Java Interlude 5 More About GenericsAn Introduction to SortingFaster Sorting Methods Java Interlude 6 Mutable and Immutable ObjectsSorted Lists Java Interlude 7 Inheritance and PolymorphismInheritance and ListsSearching Java Interlude 8 Generics Once AgainDictionariesDictionary ImplementationsIntroducing HashingHashing as a Dictionary ImplementationTreesTree Implementations Java Interlude 9 CloningA Binary Search Tree ImplementationA Heap ImplementationBalanced Search TreesGraphsGraph ImplementationsAppendices A. Documentation and Programming StyleB. Java ClassesC. Creating Classes from Other ClassesOnline Supplements Java BasicsFile Input and OutputGlossaryAnswers to Study Questions