CPSC 225 Schedule

Week 1: 1/16-1/20

Topics: course introduction, review of CPSC 124, program correctness

• slides (course introduction)
• Nim (program development example): first pass (outline with broad steps), second pass (filling in code, with placeholder variables for key values and placeholder methods for complex tasks - not quite complete)

• Eck sections 8.1, 8.2.1, 8.4.1

• slides (using placeholders in program development, correctness, assertions)
• Nim (program development example): Nim.java (a little more functionality, considering correctness - added some pre- and postconditions, other invariants)

Week 2: 1/23-1/27

Topics: robustness; review of classes and objects; objects as data structures; ADTs

• Eck sections 8.2.2, 8.3

• slides (lab 1 comments)
• slides (robustness and exceptions)

• Eck sections 5.1-5.4 (review)

• slides (correctness and robustness recap)
• slides (learning nim, imagining classes)
• Nim (program development example): Nim.java (adding ComputerPlayer to accommodate a complex computer strategy)

• Eck section 9.3 (we haven't covered all of the material referenced in this section yet - focus on what an ADT is and what stacks and queues are, what operations they have, and some applications; skip the parts about implementation)

• slides (evolution muddiest points)
• slides (data types and ADTs)

Week 3: 1/30-2/3

Topics: basic collections (List, Stack, Queue); using the Java Collections Framework; array-based implementation of List, Stack, Queue

• slides (ADTs; Sequence, Stack, Queue; Java Collections)
• Reverser and Forwarder (ADTs as part of program development; use of stacks and queues)

• Eck sections 7.3.1-7.3.3
• Eck sections 10.1.4-10.1.7

• slides (iterators)
• slides (comments on lab 2 and lab 3)

• slides (applications of stacks and queues, patterns of using arrays to implement collections)
• implementing ADTs: LinesArray.java (array-based stack), LinesQArray.java (array-based queue) [exercise for the reader: identify preconditions]
• Benford's Law comments

Week 4: 2/6-2/10

Topics: efficiency; linked lists

• Eck section 8.5

• slides (analysis of algorithms)

• Eck section 9.2

• slides (linked lists)
• ListNode.java, LinkedListDemo.java (print, insert at head, is sorted, sorted insert)

Week 5: 2/13-2/17

Topics: linked lists; linked-list based implementation of List, Stack, Queue; correctness (testing)

• slides (lab 3 comments)
• slides (arrays vs linked lists)

• slides (solitaire muddiest points)
• slides (testing)

Week 6: 2/20-2/24

Topics: testing; review of recursion; recursive data structures (binary trees)

• slides (testing - being thorough, designing for testing)
• LinkedListDemo (linked list functions), LinkedListTester (test cases for insertAtHead)
• ArraySortedList (buggy class), ArraySortedListTester (partial tester)

• Eck section 9.1

• slides (recursion)
• recursion examples

• Eck sections 9.4 (the introduction part), 9.4.1, 9.4.3

• slides (labs 4 and 5 comments), lab 4 partial solutions
• slides (trees)

Week 7: 2/27-3/3

Topics: binary trees

• comments on lab 6 and evolution
• lab 6 partial solutions (types of test cases)
• slides (binary trees and BinaryTree ADT)
• BTDemo.java (working with binary trees)

• slides (patterns of using binary trees)
• BTDemo.java (working with binary trees)

• slides (implementing binary trees)
• LinkedBinaryTree.java, TreeNode.java (linked structure implementation of binary tree)
• another implementation (more elegant version of linked binary tree which makes use of an interface to hide the internals of the tree node from users of BinaryTree)

Week 8: 3/6-3/10

Topics: recursive backtracking

• review information

• slides (comments on lab 7)

• slides (some ideas about lab 8)
• slides (recursive backtracking)

• slides (recursive backtracking)
• NQueens.java (three patterns for n queens - find a solution, find all solutions, count solutions)
• slides (muddiest points for the backtracking assignment)

Spring Break: 3/11-3/29

Week 9: 3/20-3/24

Topics: sorting and shuffling; searching

• Eck sections 7.4.3-7.4.4, 9.1.3

• slides (comments about the solitaire encryption programming assignment and exam 1, including info on the exam redo option due 4/5)
• slides (fundamental algorithms - sorting)

• Eck section 7.4.5

• SortMain.java (selection and insertion sort)

• Eck sections 7.4.1-7.4.2, 9.1.1

• slides (fundamental algorithms - sorting efficiency, recursive sorts, shuffling)

Week 10: 3/27-3/31

Topics: binary search trees, lookup; PriorityQueue and Set

• Eck section 9.4.2

• slides (comments on lab 9)
• slides (searching, sorting/searching/shuffling in Java)
• slides (lookup, Dictionary/Map)

• Eck section 10.3

• slides (lab 10 information)
• slides (binary search trees)

• Eck sections 10.2.3, 10.2.5

• slides (Map, Set, PriorityQueue)
• MapDemo.java (working with Map)

Week 11: 4/3-4/7

Topics: streams, readers, and writers; choosing classes, methods, and data structures

• Eck sections 11.1, 11.2.1-11.2.2

• file compression muddiest points
• slides (streams)

• slides (comments on lab 8)

• slides (streams)
• StreamsDemo.java (example of working with streams)

• slides (program design)
• Scrabble handout

Week 12: 4/10-4/14

Topics: designing programs; inheritance and polymorphism

• slides (program design)
• Scrabble code-in-progress

• Eck sections 5.5-5.7

• slides (representation)
• Scrabble code-in-progress

• slides (inheritance and interfaces)

Week 13: 4/17-4/21

Topics: GUI programming

• Eck sections 6.1, 6.3.1, 6.5-6.6

• adventure muddiest points
• slides (GUIs in Java)
• colored circles example: SimpleGUIDemo (components and layout, registering listeners), ColorChanger (event listener)

• review information

• slides (comments on lab 12)
• Monopoly design example

• Eck section 13.4

• colloquium announcement (extra credit!)
• slides (OOAD, and specifically Monopoly)
• Monopoly example (role of inheritance, incorporating a user interface)

Week 14: 4/24-4/28

Topics: GUI programming

Reading:

• Eck sections 6.2, 6.5-6.7, 13.3
• slides (custom painting, spacing and sizing, menus, dialogs)

• comments on Adventure design

• in class exercises

Reading:

• Eck section 13.1

• comments on Monday's exercises

• in class exercises

• comments on lab 13
• slides (MVC and JList)
• JList examples

Week 15: 5/1-5/2

Topics: GUI programming; wrapup

Reading:

• Eck section 13.2

• comments on last Wednesday's exercises

• in class exercises

• slides (exam 2 redo option due 5/9)

Reading Period: 5/3-5/5

Exams: 5/6-5/9

Slides:

• slides (comments on project 3 - backtracking)

Slides:

• slides (comments on project 4 (compression), Adventure, and labs 10, 11, and 14)

last updated: --Tue May 16 17:00:05 EDT 2017--
page owned by: bridgeman@hws.edu