CSE 143: Computer Programming II, Spring 2010

Textbook

Our required textbook for CSE 143 this quarter will be the following (the same textbook is used in CSE 142):

Reges/Stepp. Building Java Programs: A Back to Basics Approach, 2nd edition. ISBN 0-13-609181-4

• Building Java Programs: A Back to Basics Approach (authors' web site)

Students can purchase the textbook from the UW Bookstore. The book is also available to be ordered online from online retailers such as the following:

• Order Building Java Programs from Amazon.com
• Order Building Java Programs from BarnesAndNoble.com

This required book was written specifically for this course and makes a useful supplement to the lecture presentations. Also, exams in this course will be open-book, so it may be advantageous to own the book for use as a reference during exams.

The book may also be available on course reserve at the UW Engineering Library. If the book is not available on reserve, please contact the instructor.

If you see a book with our book's title but a different ISBN available for sale online (probably used), this is not the correct textbook. It is likely a copy of a previous "preliminary custom edition" version of the book that was used in past years. These older versions of the book do not contain all of the content from the correct course textbook. They are also somewhat bulky and cheaply made, not bound properly like a normal textbook would be. We do not suggest using them as your textbook for the course this fall.

New Chapters

The second edition has additional chapters that cover CSE 143 content. We understand that many students will be using the first edition version of the textbook that they purchased when they took CSE 142. We are, therefore, posting pre-production versions of the new chapters here for current CSE 143 students to read. For classroom and evaluation purposes only; please do not distribute.

• 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
  • SearchTreeNode.java
  • SearchTree.java (generic binary search tree that can store any type of element)
  • SearchTreeClient.java - output

Online Problems

We have written a web application called Practice-It that allows you to write solutions to lots of our Java practice problems. You can type in your solution and submit it to the server to be tested. You will receive feedback about whether your code succeeds or fails.