An edition of Data structures with Java (2004)

Data structures with Java

International ed.

by

  • 2 Want to read
  • 1 Currently reading
Cover of: Data structures with Java by Hubbard, J. R., Hubbard, J. R.
Preview

My Reading Lists:

Create a new list
  • 2 Want to read
  • 1 Currently reading

Check nearby libraries

Buy this book

Last edited by ImportBot
August 19, 2020 | History
Edit
An edition of Data structures with Java (2004)

Data structures with Java

International ed.

by

  • 2 Want to read
  • 1 Currently reading

This work doesn't have a description yet. Can you add one?

Publish Date
Publisher
Pearson Education
Language
English
Pages
613

Check nearby libraries

Buy this book

Previews available in: English

Subjects

Java (Computer program language) Data structures (Computer science) Data structures (computer science) Java (computer program language)
Edition Availability
Cover of: Data structures with Java
Data structures with Java
2004, Pearson Prentice Hall
in English
Cover of: Data structures with Java
Data structures with Java
2004, Pearson Education
in English - International ed.

Add another edition?

Book Details

Table of Contents

Chapter 1. Object-Oriented Programming
Problem Solving
Page 1
Object-Oriented Design
Page 5
Implementing the Software Design
Page 8
Testing the Class
Page 11
Implementing and Testing an Algorithm
Page 14
The Unified Modeling Language
Page 16
Inheritance, Aggregation, and Composition
Page 18
Mutable and Immutable Objects
Page 22
Chapter Summary
Page 27
Review Questions
Page 28
Exercises
Page 29
Programming Problems
Page 30
Projects
Page 31
Answers to Review Questions
Page 35
Chapter 2. Abstract Data Types
Page 37
Concrete Data Types
Page 37
Abstraction
Page 38
Abstract Data Types
Page 40
Preconditions and Postconditions
Page 43
Using ADTs in Algorithms
Page 45
Concrete Data Types
Page 46
Implementing Preconditions and Postconditions
Page 50
Using the assert Statement
Page 54
Class Invariants
Page 57
Inheritance and Polymorphism
Page 58
Chapter Summary
Page 61
Review Questions
Page 62
Exercises
Page 62
Programming Problems
Page 67
Projects
Page 67
Answers to Review Questions
Page 70
Chapter 3. Arrays
Page 73
Arrays in Java
Page 73
Printing an Array in Java
Page 77
Some Simple Array Algorithms
Page 77
Arrays of Objects
Page 79
The Sequential Search
Page 80
Complexity Analysis
Page 81
The Binary Search
Page 84
The java.util.Arrays Class
Page 86
A User-Defined IntArrays Class
Page 88
The java.util.Vector Class
Page 90
Multidimensional Arrays
Page 94
Case Study: Building a Concordance
Page 98
Chapter Summary
Page 110
Review Questions
Page 111
Exercises
Page 111
Programming Problems
Page 114
Projects
Page 119
Answers to Review Questions
Page 120
Chapter 4. Linked Structures
Page 121
Maintaining an Ordered Array
Page 121
Indirect Reference
Page 123
Linked Nodes
Page 125
Inserting an Element into a Linked List
Page 133
Inserting at the Front of the List
Page 136
Deleting from a Sorted Linked List
Page 138
Nested Classes
Page 139
Case Study: Arbitrarily Long Integers
Page 141
Chapter Summary
Page 146
Review Questions
Page 146
Exercises
Page 147
Programming Problems
Page 147
Projects
Page 149
Answers to Review Questions
Page 150
Chapter 5. Stacks
Page 151
The Stack ADT
Page 151
An Array Implementation
Page 153
Application: Evaluating Postfix Expressions
Page 157
Case Study: Solving a Maze
Page 159
A Linked Implementation
Page 167
The java.util.Stack Class
Page 170
Chapter Summary
Page 171
Review Questions
Page 171
Exercises
Page 172
Programming Problems
Page 172
Projects
Page 174
Answers to Review Questions
Page 175
Chapter 6. Queues
Page 177
The Queue ADT
Page 177
Case Study: Capital Gains Valuation
Page 179
A Linked Implementation
Page 181
Case Study: Simulation with Queues
Page 184
Chapter Summary
Page 195
Review Questions
Page 195
Exercises
Page 195
Programming Problems
Page 196
Projects
Page 197
Answers to Review Questions
Page 198
Chapter 7. Collections
Page 199
The Java Collections Framework
Page 199
A Simple Collection Interface
Page 200
Iterators
Page 201
An AbstractCollection Class
Page 203
An ArrayCollection Class
Page 206
A LinkedCollection Class
Page 211
The Complete java.util.Collection Interface
Page 215
The java.util.AbstractCollection Class
Page 218
Chapter Summary
Page 221
Review Questions
Page 222
Exercises
Page 223
Programming Problems
Page 227
Project
Page 229
Answers to Review Questions
Page 231
Chapter 8. Lists
Page 233
List Classes in the Java Collections Framework
Page 233
Bidirectional List Iterators
Page 234
The java.util.List Interface
Page 240
Implementing the java.util.List Interface
Page 241
Linked Lists of Primitives and Specialized Objects
Page 249
Case Study: Polynomial Algebra
Page 251
Chapter Summary
Page 260
Review Questions
Page 260
Exercises
Page 260
Programming Problems
Page 261
Projects
Page 262
Answers to Review Questions
Page 263
Chapter 9. Hash Tables
Page 265
Tables and Records
Page 265
An ADT for Maps
Page 268
Hash Tables
Page 270
Linear Probing
Page 273
Rehashing
Page 275
Other Collision Resolution Algorithms
Page 278
Separate Chaining
Page 281
The java.util.HashMap Class
Page 284
Analysis of Hashing Algorithms
Page 286
Perfect Hash Functions
Page 287
Other Hash Functions
Page 290
Chapter Summary
Page 291
Review Questions
Page 293
Exercises
Page 293
Programming Problems
Page 295
Projects
Page 296
Answers to Review Questions
Page 296
Chapter 10. Recursion
Page 297
Recursive Functions
Page 297
The Towers of Hanoi
Page 300
Fibonacci Numbers
Page 303
Calling Trees
Page 306
Storing Instead of Recomputing
Page 309
De Moivre's Formula
Page 311
The Recursive Binary Search Algorithm
Page 313
Recursive Exponentiation
Page 315
Printing Permutations
Page 315
Indirect Recursion
Page 318
Chapter Review
Page 321
Review Questions
Page 322
Exercises
Page 322
Programming Problems
Page 323
Projects
Page 326
Answers to Review Questions
Page 328
Chapter 11. Trees
Page 329
Trees
Page 329
Properties of Trees
Page 330
The Recursive Definition of a Tree
Page 336
Application: Decision Trees
Page 339
Ordered Trees
Page 341
Traversal Algorithms for Ordered Trees
Page 342
Complete Ordered Trees
Page 344
Chapter Summary
Page 346
Review Questions
Page 347
Exercises
Page 347
Programming Problems
Page 350
Project
Page 350
Answers to Review Questions
Page 351
Chapter 12. Binary Trees
Page 353
Definitions
Page 353
Properties of Binary Trees
Page 354
Counting Binary Trees
Page 355
Binary Tree Traversal Algorithms
Page 357
Expression Trees
Page 358
Complete Binary Trees
Page 362
Forests
Page 364
Chapter Summary
Page 365
Review Questions
Page 366
Exercises
Page 367
Programming Problems
Page 369
Projects
Page 373
Answers to Review Questions
Page 374
Chapter 13. Search Trees
Page 375
Keys and Comparable Types
Page 375
Binary Search Trees
Page 377
BST Deletion
Page 380
BST Performance
Page 383
AVL Trees
Page 387
Implementing AVL Trees
Page 390
Fibonacci Trees
Page 395
Multiway Search Trees
Page 397
B-Trees
Page 400
Red-Black Trees
Page 403
Chapter Summary
Page 409
Review Questions
Page 409
Exercises
Page 410
Programming Problems
Page 411
Projects
Page 412
Answers to Review Questions
Page 412
Chapter 14. Heaps and Priority Queues
Page 415
Heaps
Page 415
Heap Algorithms
Page 416
Priority Queues
Page 420
A HeapPriorityQueue Class
Page 423
Case Study: Huffman Codes
Page 426
Chapter Summary
Page 429
Review Questions
Page 430
Exercises
Page 430
Programming Problems
Page 433
Projects
Page 433
Answers to Review Questions
Page 434
Chapter 15. Sorting
Page 437
The Bubble Sort
Page 438
The Selection Sort
Page 442
The Insertion Sort
Page 444
The Shell Sort
Page 446
The Speed Limit for Comparison Sorts
Page 449
The Merge Sort
Page 450
The Quick Sort
Page 454
The Heap Sort
Page 458
The Bucket Sort
Page 462
The Counting Sort
Page 464
The Radix Sort
Page 466
The java.util.Arrays.sort() Method
Page 468
Chapter Summary
Page 468
Review Questions
Page 469
Exercises
Page 469
Programming Problems
Page 475
Projects
Page 477
Answers to Review Questions
Page 478
Chapter 16. Graphs
Page 479
Graphs
Page 479
The Adjacency Matrix Implementation
Page 482
The Adjacency List Implementation
Page 484
Breadth-First Search
Page 487
Spanning Trees
Page 488
The Depth-First Search
Page 491
Weighted Graphs
Page 492
Dijkstra's Algorithm
Page 494
Digraphs
Page 499
Chapter Summary
Page 500
Review Questions
Page 500
Exercises
Page 501
Programming Problems
Page 504
Projects
Page 505
Answers to Review Questions
Page 505
Appendix A. Answers and Hints
Page 507
Chapter 1 Exercises
Page 507
Chapter 2 Exercises
Page 509
Chapter 3 Projects
Page 509
Chapter 4 Programming Problems
Page 510
Chapter 5 Exercises
Page 511
Chapter 5 Programming Problems
Page 512
Chapter 6 Exercises
Page 513
Chapter 7 Programming Problems
Page 514
Chapter 8 Exercises
Page 514
Chapter 8 Programming Problem
Page 515
Chapter 9 Exercises
Page 515
Chapter 10 Exercises
Page 515
Chapter 10 Programming Problem
Page 516
Chapter 11 Exercises
Page 516
Chapter 12 Programming Problems
Page 517
Chapter 13 Exercises
Page 518
Chapter 14 Exercises
Page 519
Chapter 15 Exercises
Page 519
Chapter 15 Programming Problem
Page 519
Chapter 16 Exercises
Page 520
Appendix B. Java Review
Page 521
Java Programs
Page 521
Compiling and Running a Java Program
Page 522
Java Types
Page 528
Classes and Members
Page 530
Access Modifiers
Page 533
The this Keyword
Page 534
Packages
Page 535
The Scope of a Class
Page 539
The new and instanceof Operators
Page 540
Using Command Line Arguments
Page 541
Wrapper Classes
Page 544
Exception Handling
Page 545
Java I/O
Page 548
Interactive Input
Page 553
Initialization
Page 554
Interfaces
Page 556
Types and Polymorphism
Page 558
Abstract Methods and Abstract Classes
Page 558
From C++ to Java
Page 560
Appendix Review
Page 562
Review Questions
Page 562
Programming Problems
Page 563
Answers to Review Questions
Page 563
Appendix C. Essential Mathematics
Page 565
The Floor and Ceiling Functions
Page 565
Logarithms
Page 566
Asymptotic Complexity Classes
Page 567
The First Principle of Mathematical Induction
Page 569
The Second Principle of Mathematical Induction
Page 570
Geometric Series
Page 571
Other Summation Formulas
Page 572
Harmonic Numbers
Page 573
Stirling's Formula
Page 575
Fibonacci Numbers
Page 576
Binomial Coefficients
Page 578
Catalan Numbers
Page 579
Review Questions
Page 584
Exercises
Page 584
Programming Problems
Page 586
Answers to Review Questions
Page 586
Appendix D. The Java Collections Frameworks
Page 587
The Inheritance Hierarchy
Page 587
The Collection Interface
Page 588
The List Classes
Page 590
The Set Classes
Page 592
The Map Classes
Page 593
Appendix E. References
Page 599
Books
Page 599
Papers
Page 601
URLs
Page 601
Index
Page 603

Edition Notes

Includes bibliographical references and index.

Published in
London

Classifications

Library of Congress
QA76.9.D35 H83 2004

The Physical Object

Pagination
xxii, 613 p. :
Number of pages
613

Edition Identifiers

Open Library
OL15576533M
Internet Archive
datastructureswi0000hubb
ISBN 10
0131236288
LCCN
2004272032
LibraryThing
1167905

Work Identifiers

Work ID
OL1869817W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Download catalog record: RDF / JSON