After the quiz, we reviewed answers to the True/False and Multiple Choice questions at the end of Chapter 3. Then we delved into the accumulator pattern in which a final value is built up piece by piece. The example in the book is computing n! (n factorial). The same pattern is needed to solve Programming Exercises 11 and 12 [page 74]. In fact, we'll be applying it a lot in the algorithms we use this semester.
As an aside, we discussed variations on range() [pages 60].Homework
Read Chapter 4. Write down one thing you read that you think is the most significant information from the chapter. Write down another thing from the chapter that confounds you.
No comments:
Post a Comment