|
|
Homework |
|
HW # |
Due | Read | Do |
|---|---|---|---|
| Tuesday 5/3 1:00-4:00 PM (note time change!) FN 4 |
|||
|
-- |
R 4/21 | On Thursday we will do some graphics animation, see an "odometer
program," and dicuss a few other things. This will be our last
class day. If interested, skim through Chapter 10. |
|
| R 4/14 | Covers everything we've done since the last midterm exam: HWs 6, 7, 8,
and their corresponding sections, plus in-class exercises on the S:
drive in folders day08, day09, and day10. Main Topics: --Multiclause Function Definition --Recursion --Iteration: While[], For[], Do[]. |
||
|
8 |
R 4/7 | On Thursday we will discuss Iteration (While[], Do[], and For[]). I recommend reading Section 8.1 by then, but it's not required. | Think about the Maze Project and try to tell me by Thursday whether or not you think you'll want to do it (no commitments or obligations yet). |
|
7 |
R 3/31 | Section 7.3 (make sure to read the first two paragraphs!). If you need a review of last Thursday's introduction to Recursion, read Sections 7.1-7.2 before 7.3. |
Sec 7.2: 2, 7. Sec 7.3: 1. And finish day08 exercises. |
|
6 |
R 3/24 | Sections 6.1-6.3. If still not comfortable with Rules, then review Sections 5.4-5.6.) |
Sec 6.3: 1-3. |
| R 3/10 | Midterm covers Sections 3.7, 4,5, 4.6, 5.4, 5.6, assigned HW problems, plus in-class
exercises (on the S: drive). Click here for a list of the most important functions and topics you should know. For practice, here's last year's midterm #2. This year's midterm will not necessarily be the same as last year's; but there will be some similarities. It is a good way for you to test your preparedness for this midterm.
|
||
|
5 |
R 3/3 | Start reviewing for the second midterm, which will be on March 10th. |
Finish and review all class exercises on the S: drive, as well as all HW problems. |
|
4 |
R 2/24 | Sections 4.5 and 4.6. | Sec 4.5: 3. Sec 4.6: 1, 7. And finish last time's class exercises, in the day05 folder on the S: drive. |
|
3 |
R 2/17 | Section 3.7, plus pages 56-57 (also learn how Select[] works). | Sec 3.7: 1, 2, 4. Page 100: 5. Page 105: 3. |
| R 2/10 | Midterm covers Sections 3.1-3.6, assigned HW problems, plus in-class
exercises (on the S: drive). Click here for a list of the most important functions and topics you should know. For practice, here's last year's midterm #1 (ignore problem 3a; we have not covered While[] yet). This year's midterm will not necessarily be the same as last year's; but there will be some similarities. It is, nevertheless, a good way for you to test your preparedness for this midterm. |
||
|
2 |
R 2/3 | Sections 3.4-3.6. | Sec 3.4: 1-3. Sec 3.6: 1, 2. |
|
1 |
R 1/27 | Sections 3.1-3.3. | Sec 3.2: 1-4. Sec 3.3: 1-5. EC: 6. |
EC: Extra Credit problems are optional. If you do them, you can show them to me during office hours. These are problems that are interesting and sometimes more challenging; and may appear on exams only as extra credit problems (which carry no points).