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

By: Carrano, Frank M [author]Contributor(s): Henry, Timothy M [co-author]Material type: TextTextPublication details: Harlow, Essex : Pearson Education Limited, 2015Edition: Fourth edition Description: xxviii, 897 pages : illustrations ; 26 cmISBN: 978-0-13-374405-7Subject(s): DATA STRUCTURES | COMPUTER PROGRAM KNOWLEDGE | ABSTRACT DATA TYPESLOC classification: QA 76.9.D33 .C37 2015
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
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.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Home library Collection Shelving location Call number Copy number Status Date due Barcode
Books Books LRC - Main
National University - Manila
Computer Science General Circulation GC QA 76.9.D33 .C37 2015 c.1 (Browse shelf (Opens below)) c.1 Available NULIB000011016
Books Books LRC - Main
National University - Manila
Gen. Ed. - CCIT General Circulation GC QA 76.9.D33 .C37 2015 c.2 (Browse shelf (Opens below)) c.2 Available NULIB000011017

Includes index.

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

There are no comments on this title.

to post a comment.

© 2021 NU LRC. All rights reserved.Privacy Policy I Powered by: KOHA