, , , e.a.

Data Structures and Abstractions with Java, Global Edition

Paperback Engels 2015 9781292077185
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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 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. Teaching and Learning Experience This book will provide a better teaching and learning experience–for you and your students. It will help: Aid comprehension and facilitate teaching with an approachable format and content organisation: Material is organised into small segments that focus a reader’s attention and provide greater instructional flexibility. Keep your course current with updated material: Content is refreshed throughout the book to reflect the latest advancements and to refine the pedagogy. All of the Java code is Java 8 compatible. Support learning with student-friendly pedagogy: In-text and online features help students master the material.

Specificaties

ISBN13:9781292077185
Taal:Engels
Bindwijze:Paperback

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

<ul> <li>Introduction </li> <li>Chapter 1: Bags </li> <li>Chapter 2: Bag Implementations That Use Arrays </li> <li>Chapter 3: A Bag Implementation That Links Data </li> <li>Chapter 4: The Effciency of Algorithms </li> <li>Chapter 5: Stacks </li> <li>Chapter 6: Stack Implementations </li> <li>Chapter 7: Recursion </li> <li>Chapter 8: An Introduction to Sorting </li> <li>Chapter 9: Faster Sorting Methods </li> <li>Chapter 10: Queues, Deques, and Priority Queues </li> <li>Chapter 11: Queue, Deque, and Priority Queue Implementations </li> <li>Chapter 12: Lists </li> <li>Chapter 13: A List Implementation That Uses an Array </li> <li>Chapter 14: A List Implementation That Links Data </li> <li>Chapter 15: Iterators for the ADT List </li> <li>Chapter 16: Sorted Lists </li> <li>Chapter 17: Inheritance and Lists </li> <li>Chapter 18: Searching </li> <li>Chapter 19: Dictionaries </li> <li>Chapter 20: Dictionary Implementations </li> <li>Chapter 21: Introducing Hashing </li> <li>Chapter 22: Hashing as a Dictionary Implementation </li> <li>Chapter 23: Trees </li> <li>Chapter 25: A Binary Search Tree Implementation </li> <li>Chapter 26: A Heap Implementation </li> <li>Chapter 27: Balanced Search Trees </li> <li>Chapter 28: Graphs </li> <li>Chapter 29: Graph Implementations </li> </ul>

Managementboek Top 100

Rubrieken

    Personen

      Trefwoorden

        Data Structures and Abstractions with Java, Global Edition