Session 12 Preparation — Videos, Reading and Quizzes

There is no quiz for Session 12.

There was not enough material that is entirely new to warrant having a quiz (and it is nice for you to have a break).

Subsections 6.3.1-6.3.6 cover things that are part of the Session 11 exercises. We would have had you read these before session 11, but the Session 11 preparation was already long.  Reading them now will help you to firm up the ideas in your mind.

Subsections 6.3.7-6.3.9 (3.5 pages) have new ideas that you should read carefully.  The diagrams on page 295 are especially helpful.

Since you have very little preparation to do for Session 12, we encourage you to spend some time this weekend making progress on the Session 11 exercises, which you should complete before Thursday's Session 13.

• List Algorithms
  • Textbook reading: Section 6.3 — Common List Algorithms  (pages 290 - 297, 8 pages).
    Focus your attention on:
    • Building a list according to a formula (Section 6.3.1)
    • Combining List Elements (Section 6.3.2)  You did a lot of this kind of thing in Session 10 exercises.
    • Printing with separators between list elements (Section 6.3.3), but not at the beginning or end.
    • Finding Max and min(6.3.4), Searching for a n element in a list (6.3.5), Counting how many elements match a criterion (6.3.6).
    • Removing and exchanging (swapping) list elements (6.3.7, 6.3.8)
    • Filling a list with user input (6.3.9)
  • OPTIONAL (for now) Textbook Reading. This will be part of the next (larger) reading assignment.   Perhaps you want to read ahead so you do not have so much to read during the week.  Section 6.4 — Using lists with Functions  (pages 297 - 303, 6 pages).  Some students find this concept to be quite difficult.  You may want to read it once now and again before it is due at the beginning of Session 13.