Monthly Schedule

(AP Computer Science A, Period F)

M 10/1/012

No additional HW due today. Make sure that last week’s problems are up to date in your notebook.

 

T 10/2/012

HW due: Read Lesson 17.

 

W 10/3/012

HW due: Write exercises to Lesson 17, #1-26 all. Do as many as time permits. After 35 minutes, if you keep a time log, you are permitted to stop if necessary. Time spent texting or on other distractions does not count toward your 35 minutes. See the HW guidelines if you have any questions about what is required.

 

Th 10/4/012

HW due: Finish yesterday’s assignment, as we agreed in class. Then, write a Java program to implement the following requirements.

1. Program shall store the first 2000 digits of the decimal expansion of pi (see, for example, this link) into a String called digitsOfPi.

2. Program shall accept numeric input from the user. For example, a user born on March 23 may be interested in typing 323 as input.

3. If the input is found within the first 2000 digits of pi’s decimal expansion, the user shall be so informed and given the position and the first occurrence of the string in context (i.e., with 5 digits preceding the target string, the target string, and 5 digits following the target string). If the string occurs too close to the beginning or the end to be fully shown in context, the maximum number of digits that can be shown shall be shown.

Sample output:

String "323" was found at position 15: 5897932384626

4. If the input is not found within the first 2000 digits of pi’s decimal expansion, the user shall be presented with a frowny face. The emoticon 8-( is acceptable.

5. Program shall then accept additional search strings for testing.

 

F 10/5/012

No school (faculty professional day).

 

M 10/8/012

No school (Columbus Day).

 

T 10/9/012

HW due:

1. Read Lesson 18 and Lesson 19. Reading notes are required, as always.

2. Do #14 on p. 18-7 and at least 4 other Lesson 18 exercises (your choice). This is not intended to be busywork! Choose exercises that either reinforce concepts on which you need extra practice or pose interesting, non-obvious problems.

3. Do the “Array of Hope” project on p. 18-7.

 

W 10/10/012

HW due: Write #1 on p. 19-6, plus the multiple-choice problems on pp. 19-8 through 19-10.

 

Th 10/11/012

HW due: Read Lesson 20; write the first project on p. 19-11, “Sorting a String Array.”

 

F 10/12/012

HW due: Write #11, 12, 14 on p. 20-4, plus as much of the project on p. 20-6 (“How Far to the Line?”) as time permits. Be prepared to demonstrate your progress.

 

M 10/15/012

HW due:

1. Read Lessons 21 and 22. Reading notes are required, as always.

2. Write the multiple-choice questions on p. 20-7 and p. 22-4. Per our in-class agreement, these answers may be stored in a computer format if you wish. You are on your honor to come up with your own set of answers, and (so far, at least) everyone has been trustworthy. We will compare answers in class today, but not before.

3. Prepare the questions on p. 21-3 and p. 22-3 for oral presentation. Writing out the answers is optional.

In class: Project on p. 23-5.

 

T 10/16/012

HW due: Read Lesson 23 if you have not already. Then save your existing version of the project on p. 23-5, and create a new version that satisfies the following additional requirements:

(a) Output should show redacted input instead of merely reporting acceptance or rejection. In other words, a sentence that contains no target words should be echoed back as given, but a sentence that contains one or more target words must use ###### or other suitable characters to black out the target word(s) found.

 

(b) The list of target words should be accepted as user input when the application launches, instead of being hard-coded in the application.

 

(c) The application should degrade gracefully (i.e., should trap errors in an informative way) in all of the following situations:

                1. Keyword list is null.
                2. Keyword list consists of nothing but spaces.
                3. Keyword list contains one or more duplicate entries.
                2. String to be checked is null.
                3. String to be checked consists of nothing but spaces.
                4. String to be checked consists of nothing but punctuation and/or white space.

 

W 10/17/012

HW due: Draft proposal for your project. Target scope is something that can be completed in about a week. Describe enough detail with your project so that the scope can be estimated today (Wednesday) during class, negotiated, and adjusted if necessary.

The proposal should be approximately half a page if typed or a full page if handwritten. Either format is acceptable.

 

Th 10/18/012

HW due: Revised project proposal, including milestones. Target completion date is Wednesday, 10/24.

 

F 10/19/012

HW due: Work on your project.

 

M 10/22/012

HW due: Work on your project. In class would be a good time for a code review with Mr. Hansen.

 

T 10/23/012

Deadline extension requests, if any, must be submitted by today in writing. Approval is not guaranteed.

Remaining code reviews should occur today in class if at all possible.

 

W 10/24/012

HW due: Project #1 is due today unless you have negotiated an extension.

 

Th 10/25/012

HW due: Project #1 for all groups except Richard and Maria’s group.

 

F 10/26/012

HW due: Sleep. That’s an order! Richard and Maria’s group, if you get stuck, please send e-mail requesting a modification to the requirements so that “success” can be declared with less code. Your project involves a number of messy real-world issues that the other groups did not have to deal with.

 

M 10/29/012

No school (Hurricane Sandy).

 

T 10/30/012

No school (Hurricane Sandy).

 

W 10/31/012

HW due: Read Lesson 24; write #1-12 all on pp. 24-4 and 24-5.

 

 


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: 12 Feb 2013