CMPS 144 (Computer Science 2)
Fall 2008

Syllabus

Test Information

• Some sample problems to study for final exam, which will be at 5:15pm on Thursday, December 11, in the usual classroom.
• Some sample problems to study for test on November 4, 2008

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
• Recursion-related:
  • Recursion
  • Recursive Solutions to Array Problems: Three Examples
  • QuickSort: A Recursive Sorting Algorithm
• All About (Positional) Lists
• Array-based Implementation of Positional Lists
• All About Binary Trees
• All About Heaps

Example Programs

• TossableCoin: TossableFairCoin.java   TossableFairCoinTester.java   TossableCoin.html   TossableCoinTester.html

Programming Assignments

• Program #1: Six Sided Die
• Program #2: Any Sided Die
• Program #3: KeyPadLock
• Program #4: Red-Blue Partitioning with Assertions
• Program #5: Evaluating FPAE's
• Program #6: Calculator with 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)