Sample Chapters

The following is a complete sample chapter from the first edition of the textbook, to help you better evaluate whether our book is right for your course.

• Chapter 7: Arrays

Second Edition, New Chapters:

The following are draft versions of three chapters of new material being added to the second edition of the textbook, to be released in Spring 2010. The chapters are temporarily provided here for instructors and students using the first edition of the textbook to help ease the transition to the new edition.

These new chapters are password-protected. Instructors should please contact the authors to obtain the password.

• Chapter 15: Implementing a Collection Class
  • ArrayIntList.java , version 1 (constructor, add, toString)
  • ArrayIntList.java , version 2 (commented, multiple constructors, constant for capacity, size, get, indexOf, remove)
  • Client1.java - output
  • ArrayIntList.java , version 3 (enforces preconditions)
  • ArrayIntList.java , version 4 (with iterator and convenience methods)
  • Client2.java - output
  • Client3.java - output
  • ArrayList.java (generic version that can store any type of element)
• Chapter 16: Linked Lists
  • ListNode.java
  • Construct1.java (client that creates several ListNode objects)
  • Construct2.java (shortened version of Construct1)
  • LinkedIntList.java , version 1 (toString and add)
  • LinkedIntList.java , version 2 (remove, get, size, indexOf)
  • ListClient1.java - output (suboptimal client that manipulates two kinds of lists)
  • IntList.java (interface for both ArrayIntList and LinkedIntList)
  • ListClient2.java (improved client that uses IntList interface)
  • List.java (interface for list collections)
  • LinkedList.java (generic version that can store any type of element, and implements List interface)
  • ArrayList.java (generic version that implements List interface)
• Chapter 17: Binary Trees
  • IntTreeNode.java
  • IntTree.java (binary tree of integers)
  • IntTreeClient.java - output
  • IntSearchTree.java (binary search tree version of the IntTree)
  • IntSearchTreeClient.java - output
  • PointTest.java - output (program demonstrating the x = change(x) pattern)
  • PointTest2.java - output (program demonstrating the x = change(x) pattern)
  • SearchTreeNode.java
  • SearchTree.java (generic binary search tree that can store any type of element)
  • SearchTreeClient.java - output