Description

Book Synopsis
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.



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

Data Structures and Abstractions with Java Global

Product form

£74.45

Includes FREE delivery

Order before 4pm today for delivery by Mon 12 Jan 2026.

A Paperback by Timothy M. Henry, Frank Carrano

3 in stock


    View other formats and editions of Data Structures and Abstractions with Java Global by Timothy M. Henry

    Publisher: Pearson Education
    Publication Date: 6/18/2015 12:00:00 AM
    ISBN13: 9781292077185, 978-1292077185
    ISBN10: 1292077182
    Also in:
    Databases / Data management

    Description

    Book Synopsis
    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.



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

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account