Monthly Schedule

(AP Computer Science A, Blocks 2 and 5)

W 4/1/15
F

HW due (both blocks): Continue working every night on review problems from the Barron’s book. Suggested workload is 25-35 minutes per weeknight. Bring your written evidence of Tuesday night’s work in for spot-checking. Date all of your work. Free-response problems must be written out on separate sheets of paper and kept in your 3-ring binder or a spiral-bound notebook if you prefer. People who did not have any free-response problems to show on the last spot-check must do at least one free-response problem for today.

 

Th 4/2/15
G

Block 2: No class, but keep working on your Barron’s review problems, at least a few minutes’ worth. See instructions below.

HW due (Block 5): Same as for Wednesday. However, the level of organization that is required will be stepped up a notch. Time log, date, and page numbers are required for all problems. If your multiple-choice problems are not worked in the same place as your free-response writeups, include a summary (e.g., “MC #1-5 on p. ___; 3 / 5 correct”). Expectation is 25-35 minutes of solid time on task each night.

 

F 4/3/15
A

HW due: Same as for yesterday. Your time log should show 25-35 minutes of solid time on task. Please correct your errors and write short “lessons learned” statements.

 

M 4/6/15
B

HW due (both blocks, even though Block 5 does not meet today): Same as for last Friday.

 

T 4/7/15
C

HW due (both blocks, even though Block 2 does not meet today): Same as for last Friday. Block 5 will have a double HW scan today—one for work done over the weekend, one for work done for today.

 

W 4/8/15
D

HW due (both blocks): Same as for last Friday. Block 2 will have a double HW scan today—one for work done Monday night, and one for work done for today.

 

Th 4/9/15
E

HW due (both blocks, even though Block 5 does not meet today): Same as for last Friday.

 

F 4/10/15
F

HW due (both blocks): Same as for last Friday. Block 5 will have a double HW scan today—one for work done Wednesday night, and one for work done for today.

 

M 4/13/15
G

Test (100 pts.), Block 5 only. Questions will be similar to those found in the Barron’s review book and other similar sources. There will be a mixture of free-response and multiple-choice questions.

HW over the weekend (both blocks): Continue working on and touching up your Random Student Pairer programs. For your reference, the requirements are listed below.

Mandatory:
  - Two programs, one illustrating use of array(s), the other illustrating use of ArrayList.
  - Array program must illustrate sorting (any algorithm OK).
  - ArrayList program may use “random peel-off” if you prefer, but sorting is also acceptable.
  - Both programs must enforce a hard size limit of 50 names.
  - Names are to be read from a text file.
  - Names are to be paired randomly, with the results reported to the user.
  - If the number of names is odd, then the name of the “odd student” should still be listed.

Optional (“Nice to Have”):
  - Give user the option of what to do with the odd student, if any: group of 3 or floater status.
  - Detect and resolve collisions in pseudorandom sort key values assigned in array version (should be extremely rare).
  - Detect and resolve repeats in pairs assigned across multiple runs of the program (challenging, since a history of previous runs must be maintained).
  - Pretty printing.
  - Print a “pair number” for each assigned pair of students.
  - Allow user to specify certain students to be excluded from the randomization. Note: There are many ways to implement this feature, including modification of the data file protocol.

Try to include at least one of the “nice to have” requirements in at least one of your two programs. Code review will include both programs, but you will be demoing only one (preferably the one that works better).

 

T 4/14/15

No classes (Diversity Forum).

 

W 4/15/15
A

Test (100 pts.), Block 2 only. Questions will be similar to those found in the Barron’s review book and other similar sources. There will be a mixture of free-response and multiple-choice questions.

HW due (Block 5 only): Prepare your random-student selector programs, both the array version and the ArrayList version, for an in-class code review/demo in front of the class. The first 15 minutes of class will be reserved for final touch-up, and then the demos will begin. Pairs will present in random order.

 

Th 4/16/15
B

HW due (Block 2): Prepare your random-student selector programs, both the array version and the ArrayList version, for an in-class code review/demo in front of the class. The first 15 minutes of class will be reserved for final touch-up, and then the demos will begin. Pairs will present in random order.

HW due (Block 5, even though Block 5 does not meet today): Same as for F 4/3.

 

F 4/17/15
C

HW due (Block 2, even though Block 2 does not meet today): Same as for F 4/3.

HW due (Block 5): Same as for F 4/3.

In class: Finish code review/demos.

 

M 4/20/15

No school (Phi Beta Kappa day).

 

 

Return to the CSA Zone

Return to Mr. Hansen’s home page

Return to Mathematics Department home page

Return to St. Albans home page

Last updated: 18 Apr 2015