Monthly Schedule

(AP Computer Science A, Period F)

M 12/3/012	HW due: Work on your project.
T 12/4/012	HW due: Project #2.
W 12/5/012	HW due (Maria, Jack, Vince): Sleep. HW due (everyone else): Work.
Th 12/6/012	Happy St. Nicholas Day! HW due: Same as yesterday.
F 12/7/012	No additional HW due today (competition round 2). Please report to MH-102 at 8:45 a.m.
Sat 12/8/012	Competition round 2, continued. Please report to MH-102 at 8:50 a.m.
M 12/10/012	No additional HW due today, unless you still owe a project submission.
T 12/11/012	HW due: Read Lessons 28, 29, and 30, including the speed-tweaking material on p. 29-7; write the 5 contest problems on p. 29-6. Reading notes are required, as always.
W 12/12/012	HW due: 1. Read Lesson 31. 2. Write problems 1-8 on p. 30-4. 3. Finish the programming exercises from yesterday. The requirements are as follows:    Let A=uppercase alphabetic character, n=digit 1 through 9, N=digit 0 through 9.    Estimate the following probabilities when a randomly chosen license plate of format AAA nNNN is       chosen from the set of all possible license plates of that format.    (a) P(at least 2 adjacent characters match)    (b) P(all letters match and all numbers match)    You may use either the Monte Carlo method (random selection) or an exhaustive search procedure.    For the exhaustive approach, you will have more than 158 million cases to explore, which is quite a    large number but not insurmountable. Best of all (optional) would be to use both approaches and    conduct a relative-error comparison similar to what we did in class on Monday.
Th 12/13/012	HW due: Read Lesson 32; write #1-14 all on p. 32-4.
F 12/14/012	HW due: Build on yesterday’s code base to produce a table of estimated probabilities, using the format demonstrated below. The first value is provided for you in order to make sure you are on the right track. Give answers to 2 decimal places. Run a minimum of n = 10,000 iterations to produce the probability estimate for each cell in the table. Some comments in your code are required. Each cell represents an estimate of the probability of finding the stated run length of either heads or tails (or both) in a sequence of L random coin flips.
		Probability Estimates (n = ______ for each cell)
	Length of sequence (L)	HHHHH or TTTTT	6 or more H’s or T’s	7 or more	8 or more	9 or more	10 or more
	50	0.82	?	?	?	?	?
	100	?	?	?	?	?	?
	150	?	?	?	?	?	?
	200	?	?	?	?	?	?
	250	?	?	?	?	?	?
	300	?	?	?	?	?	?
	350	?	?	?	?	?	?
	400	?	?	?	?	?	?
12/17/012	HW due: Read Lesson 33; write the contest-type questions on pp. 32-5 and 33-4.
12/18/012	HW due: Finish yesterday’s programming exercise. For # of waits = 1, 2, 3, 4, 5, 10, 15, and 100, tabulate the distribution of wait times in 10 bins. The first bin should be 0-10% of max. wait time, the second 10-20%, the third 20-30%, and so on. Recommended number of iterations is 1000 per cell.
	Christmas break.

---

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