CPSC 225 Schedule

Week 1: 1/24-1/28

Topics: course introduction; program correctness

• slides: course introduction
• introductory survey (on Canvas, under "Quizzes")

• Eck sections 8.1, 8.2.1-8.2.3 (introduction to correctness and robustness, reasoning about correctness)
• Eck sections 4.1, 4.7.1, 4.6.5 (method contracts, pre- and postconditions, javadoc)

• slides: correctness (contracts, javadoc, pre- and postconditions, invariants)
• adding pre/postconditions and invariants: TimeInterval before, TimeInterval after

• Eck section 4.3.7 (throwing exceptions)
• Eck section 8.4.1 (assertions)

• slides: correctness (runtime checks)

Week 2: 1/31-2/4

Topics: correctness and robustness

• slides: correctness (testing)
• implementing test cases: TimeTester

• Eck section 8.2.4 (robust handling of input)
• Eck section 8.3 (exceptions)

• slides: lab 2 (comments on preconditions and invariants for lab 2)
• slides: robustness (exceptions)

• slides: lab 1 (comments on lab 1 hand back)
• slides: Omino! muddiest points (answers to questions about Omino!)

Week 3: 2/7-2/11

Topics: exceptions; ADTs and collections; using Java Collections classes

• Eck section 9.3 (introduction only), 9.3.1-9.3.2 (just the first few paragraphs in each - about stacks, queues, and their operations; skip the discussion of implementation) (ADTs, stacks, queues)
• Eck sections 10.1.3-10.1.7 (generic programming and the Java Collection Framework)
• Eck section 10.2 (except 10.2.2) (lists, sets, priority queues)
• Eck sections 10.3-10.3.1 (maps)

There's a lot of content here - don't worry about absorbing all of the syntax! Focus on getting the main idea of each section - what the elements of generic programming are in Java (parameterized types, iterators, for-each loops, equality and comparison, wrapper classes and autoboxing) and what lists, stacks, queues, priority queues, map, sets are (including their operations). Also don't worry about discussions of implementation (especially mentions of linked lists) or efficiency.

In Class:

• slides: collections (containers - List, Stack, Queue, PriorityQueue)
• examples: Reverser.java (using Stack), Sorter.java (using PriorityQueue), LengthSorter.java (using PriorityQueue with a comparator), LengthComparator.java (creating a Comparator)

• slides: collections (lookup and membership - Map, Set)

• review Monday's reading, now paying more attention to the details of syntax
• Eck 10.2.2 (sorting collections)

• slides: lab 3 (comments on lab 3)
• slides: collections (Java collections - Map, Set; ADTs)
• examples: LuckyNumbers.java (using Map)

• slides: ADTs
• slides: robustness (exceptions, summary of correctness and robustness)
• examples: more Omino! muddiest points (about phase 2 "final handin")

Week 4: 2/14-2/18

Topics: collections (BinaryTree); streams, readers, writers

• slides: lab 2 (comments on lab 2)
• slides: BinaryTree (ADT, usage, moving through trees)
• examples: BTDemo.java (working with trees, patterns of moving through trees); supporting classes BinaryTree.java, Node.java

• slides: lab 4 (comments on lab 4, working with trees)

• Eck 11.1 (streams, readers, writers)
• Eck 11.2-11.3 (except 11.2.3) (files)

• slides: streams
• examples: StreamsDemo.java (working with streams)

Week 5: 2/21-2/25

Topics: dynamic and partially full arrays; linked lists

• Eck 3.8.4 (partially full arrays)
• Eck 7.2 (array processing, dynamic arrays)

• slides: arrays (partially full and dynamic arrays)
• slides: comments on lab 3
• examples: ArraySequence.java (implementing a collection using partially full dynamic arrays)

• slides: comments on lab 5
• slides: file compression muddiest points

• Eck 9.2 (linked data structures)

• slides: comments on lab 4
• slides: comments on file compression (about streams)
• slides: linked lists
• examples: LinkedListDemo.java (ListNode.java)
• before and after pictures: building a list, println

Week 6: 2/28-3/4

Topics: linked lists; analysis of algorithms

• examples: LinkedListDemo.java (ListNode.java)
• before and after pictures: insertAtHead, insertAtHead - empty list, getNth, insertBefore

• slides: linked lists (and variations)
• examples: LinkedListDemo.java (ListNode.java)
• before and after pictures: splitAlternating

• Eck 8.5 (analysis of algorithms)

• slides: analysis of algorithms

Week 7: 3/7-3/11

Topics: analysis of algorithms; implementation of searching, sorting, shuffling

• slides: comments on lab 5, naming conventions, and commenting
• slides: analysis of algorithms

• Eck 7.4.3-7.4.4 (insertion sort, selection sort)

• slides: sorting algorithms (insertion sort, selection sort)
• Omino! comments and resubmit info

• Eck 7.4.1 (searching)
• Eck 7.4.5 (shuffling)

• slides: searching, shuffling (sequential search, binary search)

Week 8: 3/14-3/18

Topics: recursion

• slides: solitaire muddiest points

• Eck 9.1 (recursion)

• slides: recursion
• examples: RecursionDemo.java (implementing recursive definitions)

• slides: comments on lab 6
• slides: recursion

Spring Break: 3/19-3/27

Week 9: 3/28-4/1

Topics: implementing collections: linear collections (List, Stack, Queue), priority queues, binary trees

• slides: exam 1 redo information and comments
• slides: file compression resubmit information and comments
• slides: recursion vs loops
• slides: implementing Collections ADTs (preliminaries, Stack)
• examples: ArrayStack.java, LinkedListStack.java, ListNode.java

• slides: comments on lab 8
• slides: implementing Collections ADTs (PriorityQueue)
• examples: SortedLinkedListPQ.java

• Eck 9.4-9.4.1 (binary trees)

• slides: implementing Collections ADTs (BinaryTree)
• examples: BinaryTree.java, TreeNode.java

Week 10: 4/4-4/8

Topics: implementing collections: Map, Set; binary search trees, hashtables; choosing data structures and implementations

• Eck 9.4.2 (binary search trees)

• slides: implementing Collections ADTs (Map, Set; binary search trees)
• examples: BinarySearchTree.java (partial)

• Eck 10.3.3 (hashtables)

• slides: hashtables
• examples: BinarySearchTree.java (partial)

• slides: comments on lab 8
• slides: implementing ADTs (roundup, choosing Java Collections implementations)

Week 11: 4/11-4/15

Topics: designing programs (determining classes and methods)

• Eck 5.3.4, 5.4 (object-oriented analysis and design)

• slides: program design (identifying classes, instance variables, methods)

• slides: adventure muddiest points
• slides: program design (comments on program design)

In Class:

• slides: program design (pseudocode, representation, completing the Pennywise design)

Week 12: 4/18-4/22

Topics: designing programs; inheritance and polymorphism; intro to GUI programming and JavaFX

• slides: program design (Scrabble example)

• Eck 5.5-5.7 (inheritance, polymorphism, abstract classes, interfaces)

In Class:

• comments on adventure design
• comments on labs 7 and 9
• inheritance
• examples: bank account (inheritance, polymorphism)

• Eck chapter 6
  Read the chapter introduction and section 6.1 for the background on JavaFX, then look through the rest of the sections to get an overview of what is there.

In Class:

• more comments on adventure design
• introduction to GUI programming and JavaFX
• examples: JavaFXDemo3.java (event handling with lambda expressions), SimpleGUIDemo.java (Canvas, painting)
• supplemental examples (optional): JavaFXDemo2.java (event handling with event handler objects)

Week 13: 4/25-4/29

Topics: JavaFX; abstract classes and interfaces

Reading:

• Eck 6.1 (overview of a JavaFX application)
• Eck 6.4, 6.5 (controls, layout)

In Class:

• in-class exercises (solutions: DiceRoller.java)

Reading:

• Eck 6.2 (basic classes)
• Eck 6.3.1-6.3.3 (event handling, mouse events)

In Class:

• in-class exercises (solutions #1-4: DrawApp.java)

• inheritance
• examples: tickets (inheritance, abstract classes), creatures (interfaces)

Week 14: 5/2-5/6

Topics: JavaFX; wrapup

Reading:

• Eck 6.6.2 (menus and menubars)
• Eck 13.4.1 (dialog boxes)

In Class:

• in-class exercises (solutions: DrawApp2.java)

• in-class exercises (make up option due Fri 5/6 11:59pm)

Reading:

• Eck 6.4.5 (slider)
• Eck 13.1 (properties and bindings)
• Eck 13.2.4 (stacked canvases)

• in-class exercises (solutions: Chess.java)
• solitaire comments and resubmit info

In Class:

• slides: exam 2 redo information and comments
• slides: designing with inheritance
• slides: JavaFX wrapup
• slides: course wrapup

Reading Period: 5/7-5/9

Exams: 5/10-5/13

last updated: --Fri May 6 12:19:45 EDT 2022--
page owned by: bridgeman@hws.edu