|
|
|
|
| mon |
8/11 |
|
Schedule
Verification, Policy Statements |
| tue |
8/12 |
|
Review of Ch 1,
2, 3 and 4 classes, objects,
testing, |
| wed |
8/13 |
|
implicit and
explicit parameters, fundamental |
| thur |
8/14 |
|
data types, type
conversion, casting, data input, |
| fri |
8/15 |
|
InputStream/
buffered readers, scanner class, formatting |
|
|
|
|
| mon |
8/18 |
|
pgm 1 ex p4.4
(Pairs )using scanner, include toString( ) |
| tue |
8/19 |
|
pgm 1 |
| wed |
8/20 |
|
pgm 1 |
| thur |
8/21 |
|
pgm 2 ex p4.18
(easter) |
| fri |
8/22 |
|
Schram
ch 1 and ch 4 review ex r4.1, r4.2, r4.3, r4.6, r4.11, r4.12 due |
|
|
|
|
| mon |
8/25 |
|
pgm 2 |
| tue |
8/26 |
|
pgm 2 due |
| wed |
8/27 |
web |
pgm 3.
Design and implement a class called PairOfDice composed of 2 six
sided Die |
|
|
|
objects.
Using PairOfDice, implement a class to play the game called PIG.
On each turn, the |
|
|
|
player rolls a
pair of dice and earns points. The
goal is to reach 100 points first. If
on any turn, |
|
|
|
the player rolls
a single 1, he loses all points for that turn and control of the dice
passes to the |
|
|
|
other
player. If the player rolls
two 1's on a single roll, all points he has earned so far in the game |
|
|
|
are forfeited and
he loses control of the dice. The
player play turn over control of the dice at |
|
|
|
any time.
Thus on any roll, the player may either roll again (be a pig) and
risk losing points or |
|
|
|
give up control and risk the
other player winning. Implement
the computer player such that it |
|
|
|
always gives up
control when it has accumulated 20 or more points in a single turn. |
| thur |
8/28 |
|
pgm 3 |
| fri |
8/29 |
|
pgm 3 |
|
|
|
|
| mon |
9/1 |
no
school |
| tue |
9/2 |
|
pgm 3 |
| wed |
9/3 |
|
review ch 1-4 |
| thur |
9/4 |
|
Test
ch 1-4 and Schram ch 2 due |
| fri |
9/5 |
|
pgm 3 |
|
|
|
|
| mon |
9/8 |
|
Ch 5 applets, jframe and
graphics |
| tue |
9/9 |
|
Ch 5 applets, jframe and
graphics |
| wed |
9/10 |
web |
pgm 4 ex p5.2 (names) |
| thur |
9/11 |
|
pgm 4 |
| fri |
9/12 |
|
pgm 4 |
|
|
|
|
| mon |
9/15 |
|
pgm 4 due |
| tue |
9/16 |
E Rel |
pgm 5 ex p 5.7 |
| wed |
9/17 |
|
pgm 5 |
| thur |
9/18 |
|
pgm 5 due |
| fri |
9/19 |
|
Schram
ch 4 and rev ex r5.1, r5.3, r5.7, r5.10 due |
|
|
|
|
| mon |
9/22 |
|
pgm 6 animated
clock. Write a graphics
program that draws a clock face with a starting time that |
|
|
|
the user enters
in a text field. The user
must enter it in a hh:mm:ss style format. |
|
|
|
You need to find
out the angles of the hour and minute hands as they travel around the
dial. |
|
|
|
The minute hand
is easy as it travels 360 degrees in 60 minutes.
The angle of the hour hand |
|
|
|
is generated from
the fact that it travels 360 degrees in 720 minutes.
Design a class clock and |
|
|
|
supply a method
draw( Graphics2D g2) that draws the clock face and the hour, minute and
second hands. |
| tue |
9/23 |
|
pgm 6 |
| wed |
9/24 |
|
pgm 6 |
| thur |
9/25 |
|
pgm 6 |
| fri |
9/26 |
|
pgm 6 due |
|
|
|
|
| mon |
9/29 |
|
Decisions and
iterations ch 6 & 7 |
| tue |
9/30 |
|
Boolean logic |
| wed |
10/1 |
web |
Arrays and
arraylists ch 8 |
| thur |
10/2 |
|
Arrays and
arraylists ch 8 |
| fri |
10/3 |
|
Schram
ch 3 and r6.6, r6.8, r6.9,
r6.10, r6.12 due |
|
|
|
|
| mon |
10/6 |
|
pgm 7 ex p6.6
intx circles (as an applet) |
| tue |
10/7 |
|
pgm 7 |
| wed |
10/8 |
|
pgm 7 due |
| thur |
10/9 |
|
pgm 8 ex p7.8
random circles ( as an application) |
| fri |
10/10 |
web |
pgm 8 |
|
|
|
|
| mon |
10/13 |
|
pgm 8 due |
| tue |
10/14 |
|
pgm 9 ex p7.4
cannonball store points as Point2D objects in array/arraylist and after |
|
|
|
completing the sim, plot the
results graphically. graph should have scaleable |
|
|
|
horizontal and vertical axes |
| wed |
10/15 |
E Rel |
PSAT |
| thur |
10/16 |
|
pgm 9 |
| fri |
10/17 |
|
pgm 9 Schram
ch 5 and r7.3, r7.4, r7.5,
r7.11, r7.12 due |
|
|
|
|
| mon |
10/20 |
|
pgm 9 |
| tue |
10/21 |
|
pgm 9 |
| wed |
10/22 |
web |
pgm 9 |
| thur |
10/23 |
|
pgm 9 |
| fri |
10/24 |
|
pgm 9 due
Schram ch 8
and r8.1, r8.6, r8.7, r8.11, r8.12 due |
|
|
|
|
| mon |
10/27 |
|
pgm 10 Project
7.1 flesch I will provide the 3 documents on a |
|
|
|
disk, files called "flesch1.txt",
"flesch2.txt", and "flesch3.txt" |
| tue |
10/28 |
|
pgm 10 |
| wed |
10/29 |
web |
pgm 10 |
| thur |
10/30 |
|
pgm 10 |
| fri |
10/31 |
|
pgm 10 Schram
ch 6 due |
|
|
|
|
| mon |
11/3 |
|
pgm 10 |
| tue |
11/4 |
No
School |
| wed |
11/5 |
|
review |
| thur |
11/6 |
|
test
ch 6, 7, 8 |
| fri |
11/7 |
|
pgm 10 |
|
|
|
|
| mon |
11/10 |
|
pgm 10 |
| tue |
11/11 |
|
pgm
10 due |
| wed |
11/12 |
web |
designing classes
and testing ch 9 & 10 |
| thur |
11/13 |
|
designing classes
and testing ch 9 & 10 |
| fri |
11/14 |
|
designing classes
and testing ch 9 & 10 |
|
|
|
|
| mon |
11/17 |
|
pgm 11 proj 9.2 postal codes |
| tue |
11/18 |
|
pgm11 |
| wed |
11/19 |
web |
pgm11 |
| thur |
11/20 |
|
pgm 11 due |
| fri |
11/21 |
|
pgm 12 proj 10.1 physical
units must be completely documented and test cases turned in |
|
|
|
|
| mon |
11/24 |
Thanksgiving |
| tue |
11/25 |
Thanksgiving |
| wed |
11/26 |
Thanksgiving |
| thur |
11/27 |
Thanksgiving |
| fri |
11/28 |
Thanksgiving |
|
|
|
|
| mon |
12/1 |
|
pgm 12
Schram ch 14 due |
| tue |
12/2 |
|
pgm 12 |
| wed |
12/3 |
web |
pgm 12 |
| thur |
12/4 |
|
pgm 12 |
| fri |
12/5 |
|
review |
|
|
|
|
| mon |
12/8 |
|
test
ch 9 & 10 |
| tue |
12/9 |
|
pgm 13 combine ex p8.8 and ex
p8.9 into one program either graphical app or applet. |
|
|
|
Should draw a
square, a hexagon and allow the user to input coordinates of vertices. |
|
|
|
and then draw
polygon, compute and display perimeter and area. |
| wed |
12/10 |
web |
pgm 13 |
| thur |
12/11 |
|
pgm 13 |
| fri |
12/12 |
|
pgm 13 |
|
|
|
|
| mon |
12/15 |
|
pgm 13 due |
| tue |
12/16 |
web |
review
-no exemptions |
| wed |
12/17 |
|
finals
3,4,5 |
| thur |
12/18 |
|
finals
1,2 |
| fri |
12/19 |
|
finals
6,7 |
|
|
|
|