CMPS 144 (Computer Science 2)
Fall 2007

Syllabus

Test Information

• Final Exam: Thursday, December 13, 2007, 5:15pm in St. Thomas 360 (the usual place). You are allowed to refer to the book, graded assignments, notes, and course web pages.
• Some sample problems to study for final exam
• Some sample problems to study for test on November 8, 2007

Lecture Notes

• Software Quality
• Notes on Chapter 1 of Tymann/Schneider
• Loop invariants
  • Loop Invariants
  • Searching an Array: Development of Linear and Binary Search Algorithms
• A Development of a Counter Class Hierarchy
• Exceptions
• Cloning in Java
• Making assert Operable in Java
• All About Stacks
• All About Queues
• Comparator-Based Sorting in Java
• Recursion-related:
  • Recursion
  • Recursive Solutions to Array Problems: Three Examples
  • QuickSort: A Recursive Sorting Algorithm
• All About Binary Trees

Example Programs

• TossableCoin: TossableCoin.java   TossableCoinTester.java   TossableCoin.html   TossableCoinTester.html
• Red-Blue Partitioning

Programming Assignments

• Program #1: Six Sided Die
• Program #2: Any Sided Die
• Program #3: KeyPad Lock
• Program #4: Red-Blue Partitioning with Assertions
• Program #5: Person Partitioning (Less-Equal-Greater)
• Program #6: KeyPad Lock GUI

Java Resources

• CS Dept. Links for Java
• Java "home page"
• Java online tutorials
• Java Package Hierarchy
• Java Collections Framework
• How to Write Doc Comments for the Javadoc Tool
• jGrasp IDE
• Programming With Assertions (in Java) (tutorial)
• Generics in the Java Programming Language (tutorial)
• How to Make Frames (Main Windows) (tutorial)