Hi ! Welcome to the auxiliary page for APS105 - Fall 2005
The main page for this course can be found at CCNet.
This page will provide you with the programs that we develop during lectures.
It is not intended as a substitute for your own notes-taking or for reading the
textbook.
Lectures
WEEK 2
SEPT 19 |
TUES |
Evaluation order, char math |
WED |
Math Class, boolean opertors
and expressionis |
FRI |
if, then, find
largest(nested if, then,else), divide a by b (simple if,then,else),
determine grade (cascading
if, then else) |
READ: |
to the end of CHAPTER 3 - Decision Making |
|
WEEK 3
SEPT 26 |
|
WEEK 4
OCT 3 |
|
WEEK 5
OCT 10 |
TUES |
We did the Goldbach conjecture example in Chapter 5 |
WED |
Started looking at instances of a class - objects. Began the Fraction class |
FRI |
the Fraction class |
READ: |
to the end of CHAPTER 6 - Classes and Objects |
|
WEEK 6
OCT 17 |
TUES |
|
WED |
the Fraction class |
FRI |
Reviewed Unix commands - see the Unix handout for more info |
SKIP: |
CHAPTER 7 - You are not responsible for this material, however, you may want to read it out of interest |
READ: |
to the end of CHAPTER 8 - Arrays |
|
WEEK 7
OCT 24 |
|
WEEK 8
OCT 31 |
MON |
October 31 - Lab at 2 p.m and Midterm at 6:15 p.m. Get there early enough to
give yourself time to get settled.
Test the Vector Lab with the vector test class |
TUES |
the Seating class,
the ShowCalendar class which specifies the performance dates, and
the ShowSeatingSystem class which manages sales for show seating for all performances in a 2-dimensional array of Seating objects
|
WED |
We started string methods in the StringMethods class.
Quiz 2 retest in class - you MUST take this for a mark
|
FRI |
We did more string methods and reviewed the quiz |
READ: |
to the end of CHAPTER 9 - Strings |
|
WEEK 9
NOV 7 |
TUES |
More String methods - using substring(), Integer.parseInt(), and an itroduction to
recursion.
|
WED |
Preliminary dicussion of the Tower of Hanoi problem, and converting Euclid's algorithm for GCD to code. We also looked at a recursive algorithm for calculating Fibonacci numbers and determined that it is not efficient to use recursion for this. Why? |
FRI |
We reviewed the Tower of Hanoi algorithm in detail, and looked
at recursion and backtracking using the Maze Class. We coded walking the maze in class. |
READ: |
CHAPTER 11 - Recursion |
|
WEEK 10
NOV 14 |
READ: |
CHAPTER 10 - Searching and Sorting |
|
|