Data Structures and Abstractions with Java
United States Edition
2nd Edition
Published on 5. September 2006
Book
Hardback
1024 pages
978-0-13-237045-5 (ISBN)
Description
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 5, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
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 5, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
More details
Edition
2nd edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 214 mm
Width: 264 mm
Thickness: 42 mm
Weight
2006 gr
ISBN-13
978-0-13-237045-5 (9780132370455)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Frank M. Carrano
Data Structures and Abstractions with Java
Book
12/2011
3rd Edition
Pearson
€129.98
Article is exhausted; no reprint
Person
Frank M. Carrano is a professor emeritus of computer science at the University of Rhode Island. He received the 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.
Frank's Making it Real blog http://frank-m-carrano.com/blog/ extends his textbooks and lectures to a lively discussion with instructors and students about teaching and learning computer science.
Follow Frank on Twitter: http://twitter.com/Frank_M_Carrano
Find him on Facebook: https://www.facebook.com/makingitreal
Walter Savitch received the Ph.D. degree in Mathematics from the University of California at Berkeley in 1969. Since that time he has been on the faculty at the University of California at San Diego and is currently a Professor of Computer Science and director of the Interdisciplinary Ph.D. Program in Cognitive Science. Professor Savitch's research areas include complexity theory, formal language theory, computational linguistics, and the development of computer science education materials. In addition to writing numerous research articles and involvement in other editorial projects, he has written a number of well-known computer science textbooks, including Pascal, Ada, and C++ CS1 and CS2 textbooks.
Frank's Making it Real blog http://frank-m-carrano.com/blog/ extends his textbooks and lectures to a lively discussion with instructors and students about teaching and learning computer science.
Follow Frank on Twitter: http://twitter.com/Frank_M_Carrano
Find him on Facebook: https://www.facebook.com/makingitreal
Walter Savitch received the Ph.D. degree in Mathematics from the University of California at Berkeley in 1969. Since that time he has been on the faculty at the University of California at San Diego and is currently a Professor of Computer Science and director of the Interdisciplinary Ph.D. Program in Cognitive Science. Professor Savitch's research areas include complexity theory, formal language theory, computational linguistics, and the development of computer science education materials. In addition to writing numerous research articles and involvement in other editorial projects, he has written a number of well-known computer science textbooks, including Pascal, Ada, and C++ CS1 and CS2 textbooks.
Content
Introduction
Chapter 1 Java Classes
Chapter 2 Creating Classes from Other Classes
Chapter 3 Designing Classes
Chapter 4 Lists
Chapter 5 List Implementations That Use Arrays
Chapter 6 A List Implementation That Links Data
Chapter 7 Completing the Linked Implementation of a List
Chapter 8 Iterators
Chapter 9 The Efficiency of Algorithms
Chapter 10 Recursion
Chapter 11 An Introduction to Sorting
Chapter 12 Faster Sorting Methods
Chapter 13 Sorted Lists
Chapter 14 Inheritance and Lists
Chapter 15 Mutable, Immutable, and Cloneable Objects
Chapter 16 Searching
Chapter 17 Dictionaries
Chapter 18 Dictionary Implementations
Chapter 19 Introducing Hashing
Chapter 20 Hashing as a Dictionary Implementation
Chapter 21 Stacks
Chapter 22 Stack Implementations
Chapter 23 Queues, Deques, and Priority Queues
Chapter 24 Queue, Deque, and Priority Queue Implementations
Chapter 25 Trees
Chapter 26 Tree Implementations
Chapter 27 A Binary Search Tree Implementation
Chapter 28 A Heap Implementation
Chapter 29 Balanced Search Trees
Chapter 30 Graphs
Chapter 31 Graph Implementations
Appendix A Java Essentials
Appendix B Exception Handling
Appendix C File Input and Output
Appendix D Documentation and Programming Style
Appendix E Answers to Self-Test Questions
Index
Chapter 1 Java Classes
Chapter 2 Creating Classes from Other Classes
Chapter 3 Designing Classes
Chapter 4 Lists
Chapter 5 List Implementations That Use Arrays
Chapter 6 A List Implementation That Links Data
Chapter 7 Completing the Linked Implementation of a List
Chapter 8 Iterators
Chapter 9 The Efficiency of Algorithms
Chapter 10 Recursion
Chapter 11 An Introduction to Sorting
Chapter 12 Faster Sorting Methods
Chapter 13 Sorted Lists
Chapter 14 Inheritance and Lists
Chapter 15 Mutable, Immutable, and Cloneable Objects
Chapter 16 Searching
Chapter 17 Dictionaries
Chapter 18 Dictionary Implementations
Chapter 19 Introducing Hashing
Chapter 20 Hashing as a Dictionary Implementation
Chapter 21 Stacks
Chapter 22 Stack Implementations
Chapter 23 Queues, Deques, and Priority Queues
Chapter 24 Queue, Deque, and Priority Queue Implementations
Chapter 25 Trees
Chapter 26 Tree Implementations
Chapter 27 A Binary Search Tree Implementation
Chapter 28 A Heap Implementation
Chapter 29 Balanced Search Trees
Chapter 30 Graphs
Chapter 31 Graph Implementations
Appendix A Java Essentials
Appendix B Exception Handling
Appendix C File Input and Output
Appendix D Documentation and Programming Style
Appendix E Answers to Self-Test Questions
Index