MCX2 News and Bulletins
MCX2 home
Instructions for file sharing
To make your files available to your project members
1. Delete any chmod or umask commands in your .bash_profile
2. From the Linux command line:
1. cd (switch to your root directory)
2. chmod 744 * (grant read privileges to visitors)
3. chmod 777 ~ (allow visitors to list files in your root)
3. Step 2 should do it. If you still encounter problems:
1. chmod 777 91-APmarine (if 91-APmarine is name of project
directory)
2. chmod 777 91-APmarine/*
Due Mon 2/03/03: Class
in room 635
1. Purchase Barron's How to Prepare for the
Comp Sci AP Exam (Roselyn Teukolsky) as soon as possible.
Amazon is selling it for
$10.47
a. Amazon
($10.47 + shipping),
b. Barnes
& Noble ($13.34 + tax + shipping),
c. Barron's
($13.46 + tax + shipping), d. eBay
Due Tues 2/03/03: Class
in room 635
1. Purchase Barron's How to Prepare for the
Comp Sci AP Exam (Roselyn Teukolsky) as soon as possible.
a. Amazon
, b. Barnes
& Noble , c. Barron's, d. eBay
2. Programming [hardcopy
or handwritten] Download ADTsortList.cpp,
complete as specified, and run
program to validate your solutions.
Due Weds 2/05/03: Class
in room 635
1. Purchase Barron's How to Prepare for the
Comp Sci AP Exam (Roselyn Teukolsky) as soon as possible.
a. Amazon
, b. Barnes
& Noble , c. Barron's, d. eBay
2. Programming [hardcopy
or handwritten] Download remDups.cpp,
complete as specified, and run
program to validate your solutions.
Due Thurs 2/06/03: Fri
quiz possible (box-tracing, etc...)
1. Purchase Barron's How to Prepare for the
Comp Sci AP Exam (Roselyn Teukolsky) as soon as possible.
a. Amazon
, b. Barnes
& Noble , c. Barron's, d. eBay
2. Reading & multiple choice
questions:
a. Read Litvin pp. 78-81 (recursion) and box-trace
Example 31 (p. 79) and Example 32 (p. 80) as we
did in class.
3. Programming [hardcopy
or handwritten]
1.
For this short programming assignment you'll be asked to
implement an nCr function recursively. Keep
in mind that nC0 = 1, nCn = 1, and for nCr, n >= 1 and r >= 0.
Exploit the recursion inherent in the
formation of Pascal's Triangle:
1
1
1
1
2
1
1
3
3
1
4C0
4C1
4C2
4C3 4C4
Notice that 4C1 = 3C0 + 3C1, for
example. Download nCr.cpp,
complete as specified, and run
program to validate your solutions. Property
to note: more than one base case!!!
If you implemented nCr last
semester: Complete the optional part. Implement printRows to generate
Pascal's triangle rather than the
default arithmetic triangle.
2. If you
didn't get remDups.cpp
to perform correctly, try again!!
Due Fri 2/07/03: quiz
possible (box-tracing, etc.. )
1. Purchase Barron's How to Prepare for the
Comp Sci AP Exam (Roselyn Teukolsky) as soon as possible.
2. Reading & multiple choice
questions:
a. Read Litvin pp. 76-78 (focus on
insertion sort)
3. Programming [hardcopy
or handwritten] Download sortShell.cpp
(from my site) or sortShell.cpp
(from school server)
and implement insertion sort. DO NOT USE IMPLEMENTATION shown in
Litvin.
Due Mon 2/10: quiz
definite (box-tracing, etc.. )
0. Absence on a test
day: Parent must
call Attendance Office (212)312-4800 ext. 2031
and leave message and phone # where they can be contacted.
(Do NOT call chairman)
1. Purchase Barron's How to Prepare for the
Comp Sci AP Exam (Roselyn Teukolsky) as soon as possible.
2. Reading & multiple choice
questions:
a. Litvin p. 189 #1-2
3. Programming [hardcopy
or handwritten]
a. Download iSortTest.cpp
(it compares times of swap-less and swap-laden implementations of insertion
sort) and run
b. Download caveS.cpp
and add additional rule in move function for robot movement: moving
down. Before you run
revised program, see
if you can determine what impact (if any) the additional capability will
have on the outcome.
b1.
If move down the last call of the recursion step, make it the
first call to see what difference this makes.
b2.
Add one more rule to enable robot to succeed in the example in which it
currently fails.
Due Tues 2/11: PERIOD
2 STARTS AT 8:29
Test Fri
1. Purchase Barron's How to Prepare for the
Comp Sci AP Exam (Roselyn Teukolsky) as soon as possible.
2. Reading & multiple choice
questions:
a. Litvin p. 189 #3-4
3. Programming [hardcopy
or handwritten]
a. In sortShell.cpp,
implement bubble sort & run
program to validate your solution and change statement
around line 31 from:
const int bestWorstSIZE(2000)
to const int bestWorstSIZE(4000)
b. Download isPal.cpp
and complete as specified.
Due Weds 2/12: Test Fri (Review
& practice recursion problems in Teukolsky
start on p. 164)
0. Setting up
Visual C++ for C++ strings
& apstrings: Chris
Russo's example at
the bottom of the page
1. Purchase Barron's How to Prepare for the
Comp Sci AP Exam (Roselyn Teukolsky) as soon as possible.
2. Programming [hardcopy
or handwritten]
a. In sortShell.cpp,
implement selection sort & run
program to validate your solution.
b. Modify sortShell.cpp
1. Insert this
2-line prototype after Data struct specification at beginning of
program:
template <class T>
void shellVec(apvector<T> &);
2. Insert
the statement shellVec(v) in body of the msort and qsort
functions.
3. These
changes will enable the calls to merge & quick sort algorithms to sort
successfully
because shellVec(v) invokes a valid shell sort function. This, in
turn, enables menu selection 6
(best/worst cases) to operate correctly since now all 5 sorts function correctly. Therefore,
choose 6 and disregard results for merge and quick sorts.
Due Thurs 2/13: Test Fri (Review
& practice recursion problems in Teukolsky
start on p. 164)
0. Absence on a test
day: Parent must
call Attendance Office (212)312-4800 ext. 2031
and leave message and phone # where they can be contacted.
(Do NOT call chairman)
1. Reading & multiple choice
questions:
a. Teukolsky (Barron's) Read pp.
291-292 (insertion & selection sorts) before doing multiple
choice
problems #15-16, 18,
20, 23 and p. 172 #1-4
b. Big-O notation: Read Teukolsky (Barron's)
pp. 80-81 & answer multiple choice #21-24
If Teukolsky
hasn't arrived, read Litvin pp. 118-119 & answer multiple
choice p. 204 #25, 28
Test Fri 2/14: Test Fri Stay
tuned for spring break assignment.
1. Absence on a test
day: Parent must
call Attendance Office (212)312-4800 ext. 2031
and leave message and phone # where they can be contacted.
(Do NOT call chairman)
Due Mon 2/24:
0. If you still haven't received
Barron's How to Prepare for the Comp Sci
AP Exam
(Roselyn Teukolsky), see if you can cancel
your order with Amazon and order thru eBay
(copies available
for shipping now) or thru Barron's
own website.
1. Programming [hardcopy
or handwritten]
a. Read Barron's pp.
299-300 (sequential & binary search). Then do multiple
choice p.303 # 2-5 & 12-13.
b. Download bSearch.cpp
(it's at my web site) and complete as specified.
Due Tues 2/25: Quest Fri (Big-O, pseudo-random numbers, mergesort)
0. If you still haven't received
Barron's How to Prepare for the Comp Sci
AP Exam
(Roselyn Teukolsky), see if you can cancel
your order with Amazon and order thru eBay
(copies available
for shipping now) or thru Barron's
own website.
1. Programming [hardcopy
or handwritten]
Write short program that uses Monte
Carlo Method to approximate pi. See generating
random numbers
if you were absent Fri 2/14
Program requirements:
1. After every 10,000
events, running totals and current approximation should be printed.
2. The coordinates of
each pseudo-random (x, y) should be long integers and pi should be double
3. Program should be an
infinite loop.
Due Weds 2/26: Quest Fri (Big-O, pseudo-random numbers, mergesort)
0.
The AP Exam:
read Litvin pp 6-7 (Grading), and pp. 8-9 (A vs AB Exam)
1.
Barron's p. 303 #6-8, 17-18
2. Programming [hardcopy
AND
handwritten] HAVE
handwritten AND hard copy
1. Print AP 2000 A
Exam: question 4 (which was also question 1 on 2000 AN Exam).
Now time the rest of what
you do here:
2. Read question carefully for at least 5
minutes. Make sure you really understand the question.
3. HANDWRITTEN: write (don't type) answers
to the question as specified.
4. Note the time that steps 2 and 3
required. On the AP exam, 26.25 minutes is the rate at which you must
answer the 4
programming question.
4. Now download 00ab1.cpp
(shell for 2000 A #4 & AB #1), type in solutions, and run
program to validate them.
Due
Thurs
2/27: Quest Fri (Big-O, pseudo-random numbers, mergesort)
0.a.
Mistake in AP 2000 A Exam
Question 4, Part (b) function's return type:
Point
Encryptor::EncryptTwo(const apstring & pair) const;
should be
apstring
Encryptor::EncryptTwo(const apstring & pair) const;
0.b. The AP Exam:
read Litvin pp 6-7 (Grading), and pp. 8-9 (A vs. AB Exam)
1.
Barron's p. 303 #22-23
2. Programming [hardcopy
or handwritten]
In sortShell.cpp
complete merge sort, run program, and choose menu selections 4 and 6 to
validate.
Due Fri 2/28: Quest Fri (Big-O, pseudo-random numbers, mergesort)
0. The AP Exam:
read Litvin pp 6-7 (Grading), and pp. 8-9 (A vs. AB Exam)
1. Remember: quest will include 10 short answer questions based on
ALL the Barron's short
answers that have been assigned this semester. So review them
(if you haven't done so already).
Due Mon 3/3: Quest Fri
0. The AP Exam:
read Litvin pp 6-7 (Grading), and pp. 8-9 (A vs. AB Exam)
1. Programming [hardcopy
or handwritten]
Download findKth.cpp
and WITHOUT SORTING, see if you can develop a strategy for determining the
kth
element in vector v if vector v were
sorted..
Due Tues 3/4: Quest Fri: the pivot-partition method & quick sort
0. MXC2 tutoring: Wednesdays 3:15-4:45, room 407
1. Programming [hardcopy
or handwritten]
In findKth.cpp:
1. Write a partition function
as described in class today. Note: the first nested loop condition should
be
while ( v[right] > pivot ) right--;
Must use strong inequality rather than >= to guard against running off
the vector.
2. Use partition function to
write findKth. A recursive approach here would be a helpful step towards
mastering the
quick
sort in the very near future.
Due Weds 3/5: Quest Fri: the pivot-partition method & quick sort
0. MXC2 tutoring: Wednesdays 3:15-4:45, room 407
1. Programming [hardcopy
or handwritten]
In sortShell.cpp
1. Implement a partition function
immediately above the quick sort function.
2. Using partition function,
complete quick sort, run program, and choose menu selections 5 and 6 to
validate.
Due Thurs 3/6: Quest Fri: the pivot-partition method & quick sort
0. Optional:
1. See animated demonstrations of our 5
sorting algorithms: sort
demos (click on gray square)
2. Kenny Peng found an interesting combsort algorithm.
Just as the shell sort modifies the insertion sort algorithm
to achieve significant
performance gains, the combsort modifies the bubble sort in a
similar way: combsort
1. Programming [hardcopy
or handwritten]
In sortShell.cpp
1. Implement new version
of qSort that integrates the task of the partition function in the qSort
function. Don't
forget to rename the original qSort function qSort2. Hint: this is
little more than a cut and paste exercise!
2. Run program, and choose menu selections 5 and 6 to
validate.
Due Fri 3/7: Quest Fri: the pivot-partition method & quick sort
0. Optional:
1. See animated demonstrations of our 5
sorting algorithms: sort
demos (click on gray square)
2. Kenny Peng found an interesting combsort algorithm.
Just as the shell sort modifies the insertion sort algorithm
to achieve significant
performance gains, the combsort modifies the bubble sort in a
similar way: combsort
1. Programming [hardcopy
or handwritten]
1. Print
2000 A Exam Question 1 and read Parts a and b
2. Answer Parts a and b on paper
3 Download 00a1.cpp
(new link),
enter solution for Parts a and b, and run program to validate your solution
Due Mon 3/10:
1. Reading in Hubbard (Schaum's Outline):
1. Read sects 10.1 thru 10.3, 10.5, 10.7 thru 10.10
2. On p. 248, answer Review Questions 10.1-10.2,
10.4-10.6, 10.8-10.15.
3. Do programming Problem 10.1 on p. 249
(and check solution)
2. Programming [hardcopy
or handwritten]
1. In 2000 A Exam Question
, read Part c (Must do Parts a and b to run and test Part
c)
2. Answer Part c on paper
3 In 00a1.cpp
(new link) or 00a1.cpp (old link),
enter solution for Part c, and run program to validate your solution
Due Tues 3/11 MCX2 Tutoring Weds 3:15-4:45, Room 407
1. Reading
1. In Barron's, read pp. 4-5 on enumerated
types before answering p. 54 #1-6
2. Programming [hardcopy
or handwritten]:
1.
Download Rational1.cpp
and complete Programming Instructions 1 and 2.
Due Weds 3/12 MCX2 Tutoring Weds 3:15-4:45, Room 429 ?? this week
1. Reading & multiple choice
1. Hubbard: Read sect. 10.4 (constructor
initializer lists), 11.4 (overloading arithmetic operators),
11.7 (overloading stream operators)
2. In Barron's, p. 54 #7-9 (in 6 minutes)
2. Programming [hardcopy
or handwritten]:
1.
In Rational1.cpp,
1. Change: private:
void gcd();
To: private:
int gcd () const;
void reduce();
2. Implement overloaded + and - and ^ operator
3. In the raiseDriver function, copy and paste this code before the for
loop:
Rational A(3, 4), B(1, 5), C;
cout << "A = " << A << "\tB= "
<< B << "\tC = " << C << endl;
cout << "A + B = " << (A + B) << "\tA - B
= " << (A - B) << endl << endl;
OUTPUT: A + B = 19/20 A - B = 11/20
Due Thurs 3/13
1. Reading & multiple choice
1. Hubbard: Read sect. 7.1 (reference
operator),7.3 (pointers), 7.4 (dereference operator)
2. Hubbard p. 173 Review questions 7.1, 7.2,
7.5-7.7
3. In Barron's, p. 54 #10-13 (in 8 minutes),
2. Programming [hardcopy ]
Download, program, & run pointer.cpp
Due Fri 3/14 NO QUIZ FRI
1. Reading & multiple choice
1. Hubbard: Read pp. 167-168: The new
and delete operators
2. In Barron's, p. 347 #1-4 (in 8 minutes),
2. Programming [hardcopy ]
Download, program, & run pointer2.cpp
Due Mon 3/17
1. Reading & multiple choice
1. Read Litvin pp. 91-93 and review Hubbard
sections 7.1, 7.3 & 7.4
2. Barron's p. 347 #5-8 (in 8 minutes)
2. Programming [hardcopy ]
Download linkedShell.cpp
2. Complete function insertFront
and run program to test your solution
3. Do the same for functions countList
and insertEnd
Due Tues 3/18
1. Reading & multiple choice
1. Barron's p. 347 #9-11 (in 6 minutes)
2. Programming [hardcopy ]
Download linkedShell.cpp
Brian C found an error: IF
YOU DOWNLOADED linkedShell.cpp
BEFORE 10AM ON SUNDAY
1. Go to line 229 in removeProc and
change
if (choice == '2') to if (choice
== '3')
This fixes a
problem in the driver
2. Complete insertInOrder
3. Implement
removeUnordered ONLY TO REMOVE the first element, if the first element
matches
parameter city
Due Weds 3/19
1. Reading & multiple choice
2. Programming [hardcopy ]
Brian C found an error: IF
YOU DOWNLOADED linkedShell.cpp
BEFORE 10AM ON SUNDAY,
Go to line 229 in removeProc and
change
if (choice == '2') to if (choice
== '3')
This fixes a
problem in the driver
1. In linkedShell.cpp,
complete removeUnordered (started in class) iteratively
(this will be checked)
and try
recursive version.
2. Download 1ab3.cpp
and complete linked list insertion function addStudent as
specified. (in 25 minutes or less--should be a lot less).
Due Thurs 3/20
1. Reading & multiple choice
2. Programming [hardcopy ]
1. In linkedShell.cpp,
complete destroy recursively.
2. Print 1998
AB Exam: Question 3, complete on paper in 25 minutes or less.
Then download 98ab3.cpp,
enter solutions, and run program to validate.
Due Fri 3/21 (test)
Due Mon 3/24
1. Reading & multiple choice
Litvin (not Barron's) p. 189 #1--6 (12 minutes)
Due Tues 3/25
1. Reading & multiple choice
Litvin (not Barron's) p. 189 #7-8 (4 minutes)
2. Programming [hardcopy ]
1. In Rational1.cpp, implement
the overloaded assignment operator and run to verify that it
supports chaining.
2. Download dLinkedShell.cpp
and implement insertFront and insertEnd;.
Due Weds 3/26
0. Report to Room 411
1. Reading & multiple choice
2. Programming [hardcopy ]
1. In dLinkedShell.cpp
implement insertInOrder and removeUnordered.
Due Thurs 3/27
0. Report to Room 411
1. Reading & multiple choice: Litvin (not Barron's) p. 189
#9-11 (9 minutes)
2. Programming [hardcopy ]
Due Mon 3/31 Test Friday
1. Reading & multiple choice: Litvin (not Barron's) p. 189
#12-13 (6 minutes)
2. Programming [hardcopy ] Complete
as many as you can:
In dLinkedShell.cpp,
complete append iteratively & recursively,
In mergeLists.cpp, complete iterative
and recursive versions.
In linkedShell.cpp,
complete sort function.
Due Tues 4/01 Test Friday
1. Reading & multiple choice:
a. Litvin (not Barron's) p. 189 #14 (3 minutes)
b. Read Litvin pp. 97-99
2. Programming [hardcopy ] Complete
as many as you can:
In dLinkedShell.cpp,
complete removeInOrder recursively.
Due Weds 4/02 Test Friday
1. Reading & multiple choice:
a. Litvin (not Barron's) p. 189 #15 (3 minutes)
2. Programming [hardcopy ]
0. If your version of StackTest.cpp
doesn't have menu selection 8, download the revised version
1. Download StackTest.cpp,
Stack.h,
and Stack.cpp
2. In Stack.cpp, implement Stack(), isEmpty(),
push, both pops, and makeEmpty
Due Thurs 4/03 (Do Weds' assignemnt 1st) Test Friday
1. Reading & multiple choice:
a. Litvin (not Barron's) p. 189 #16-18 (2 minutes
each = 6 minutes)
2. Programming [hardcopy ]
0. If your version
of StackTest.cpp
doesn't have menu selection 8, download the revised version
1. In Stack.cpp, implement
destructor, copy constructor, and operator=
Due Mon 4/07
1. Reading & multiple choice:
a. Barron's: Read pp. 225-228
b. Barron's: Mult choice p. 238 #1-2, 6-7
2. Programming [hardcopy ]
1. In StackTest.cpp,
implement reverseProc as a client.
Due Tues 4/08
1. Reading & multiple choice:
2. Programming [hardcopy ]
1. Download cLinked.cpp,
and implement all functions.
Due Weds-Thurs 4/9-4/10 Report to room 411
Due Mon 4/14
1. Reading & multiple choice:
1. A simple postfix calculator program: calcS.cpp
2. Programming [hardcopy ]
1. Download Stacktestt.cpp
(templated stack client program), Stackt.cpp
(implementation file), and
Stackt.h
(header file)
2. In Stackt.cpp
implement all functions that haven't been completed. Don't forget to
compile, link, and run from Stacktestt.cpp.
3. Due Tues: Print 92 AB question 2, solve in 15
minutes or less, enter solutions in 92ab2.cpp,
and run program to validate solutions.
Due Tues 4/15 (Do Monday's HW first)
1. Reading & multiple choice:
1. Read Litvin (queues) pp. 99-102
2. A simple postfix calculator program: calcS.cpp
2. Programming [hardcopy ]
1. Download QueuetShell.cpp
(templated queue implementation & driver) and implement
2. Download 92ab2.cpp
(test question driver), enter solutions, and run program to validate
Due Weds 4/16
1. Download 92ab2.cpp
and enter (improved) test solutions for Location and moveToFront
2. Download treeShell.cpp
a. Choose menu selection 7 (pre-built tree)
b. Implement preOrder, postOrder, inOrder
& note the different output
each produces.
c. Implement countNodes
d. Try to implement search. Hint: use brute
force--the "British Museum" search approach
3. Read Litvin p. 102-105 (on binary trees)
Spring break
assignment: Due Mon 4/28 (4-day study program)
1. Marine Biology case
study: do NOT try to complete this assignment in a single day!!
A. Set up compiler for case
study
1. See obtaining Marine
Biology Case Study files
2. See Building
the Marine Biology case study program with Dev-C++
B. Day #1: In Marine
Biology Case Study document (you need Adobe Acrobat):
1. IMPORTANT: Print out Introduction and
Background (page 6) and Appendix B (pp. B1--B10, the header files))
2. Read Part I (pp. 7-18)
C. Read Gary
Jaye's Narrative of the Marine Biology Case Study
Note: You can't learn the case study classes without referring to the
header files as you read the narrative.
There are simply too many details. Just _reading_ will not lead to the
understanding you need to develop
in order to learn the Marine Biology case study classes.
1. Day #2: Sections
1-3: 1. Overview, 2 Position & Neighborhood classes, 3. Intro to
Environment class
a.
IMPORTANT: Print
out Appendix C (pp. C1--C12, the implementation files)
2. Day #3: Sections
4-5: 4. The Fish class & EmptyNeighbors() & ShowMe 5.
Fish::Move()
Note: You can't learn the case study classes without referring to the
header files as you read the narrative.
There are simply too many details. Just _reading_ will not lead to the
understanding you need to develop
in order to learn the Marine Biology case study classes.
D. Other
Marine Biology Case Study resources are available
2.
Day #4: Programming:
1. In treeShell.cpp,
implement search under assumption that the binary tree being
searched is
is a BST (binary
search tree), and try to implement a recursive insert
2a. Print 1996
AB Question 3, answer in 25 minutes or less
b. Download 96ab3.cpp,
enter solutions, and run program to validate them.
3. Complete multiple choice handout.
Due Tues 4/29
1. Programming [hardcopy ]
1. In treeShell.cpp,
implement recursive search & insert
2a. Print out 1999 AB
question #4 and download 99ab4.cpp
2b. In 25 minutes or less, read question and
hand-write solutions.
2c. Enter solutions in 99ab4.cpp
and run program to validate them.
Due Weds 4/30
1. Programming [hardcopy ]
1. In treeShell.cpp,
implement recursive remove
2a. Print out 1997 AB
question #3 and download 97ab3.cpp
2b. In 25 minutes or less, read question and
hand-write solutions.
2c. Enter solutions in 97ab3.cpp
and run program to validate them.
Due Thurs 5/01
1. Programming [hardcopy ]
1. Download heapShell.cpp,
PERIOD 1:
implement constructor with additional assignment,
Heap::Heap(int
size) : last(0), item(size) {
item[0]
= Record(INT_MAX, "");
}
Without this statement, our
version of insert won't work!! (Thanks Eugene)
Then implement isEmpty, isFull (refers to item's
capacity), and insert
2a. Print out 1995 AB
question #4 and download 95ab4.cpp
2b. In 25 minutes or less, read question and
hand-write solutions.
2c. Enter solutions in 95ab4.cpp
and run program to validate them.
2. Reading & multiple choice:
1. Read Litvin (heaps) pp. 111-114
Due Fri 5/02
0. Make every effort to bring in print out of
Part
1 of Guide to Case Study
1. Programming [hardcopy ]
1a. Print out 1997 AB
question #4
2b. In 25 minutes or less, read question and
hand-write solutions.
2. Reading & multiple choice:
1. Read Litvin (hashing) pp. 116-117
2. Read Litvin (heaps) pp. 111-114
3.
Correction: Heap
constructor assignment should have been
item[0]
= Record(INT_MAX, "");
not item[0]
= Record(MAX_INT, "");
Due Mon 5/05
0. Make every effort to bring in print out of
Parts
1 & 2 of Guide to Case Study
1. Reading & multiple choice:
1. If you haven't done so, read Parts 1 & 2
of Guide to Case Study
with print outs of Appendices
B & C of
Case Study document.
2. With the help of Appendices B & C,
complete Worksheets 1, 2, & 3 (distributed in class)
Period 1: print out
Worksheet #2
3. Fri or Sat:
Do Litvin's
A-1 Multiple Choice (4 questions) in 8 minutes or less then check your
solutions
4. Sun: Do Litvin's
A-2 Multiple Choice (4 questions) in 8 minutes or less then check your
solutions.
2. Programming [hardcopy ]
1. Fri or Sat:
Litvin's A-1
Free Response (programming question) in 25 minutes or less and check
your solutions.
2. Sun:
Litvin's A-2
Free Response (programming question) in 25 minutes or less and check
your solutions.
Due Tues 5/06 (last day before AP
exam)
AP Exam 6th Floor Gym at 7:45 AM on Weds
0.
Bring in Litvin
1. Reading & multiple choice:
1. With the help of Appendices B & C,
Do Litvin's
AB-1 Multiple Choice and
AB-2 Multiple Choice
2. Do as many Litvin multiple choice, starting on
p. 225, as you think you need.
2. Programming [hardcopy ]
0. Complete
parts a, b, c from Monday's handout
1.
Litvin's
AB-2
Free Response
2a. A Exam candidates: print 1995
A Exam: question 2 and solve. Solutions will be posted at 95a2S.txt
2b. AB Exam candidates: print 2000
AB Exam: question 4 and solve. Solutions will be posted at 00ab4S.txt
|