• New Partners!

Overview

• Preliminaries.
  • Admin.
  • Upcoming Work.
  • Extra Credit.
  • Quick notes on exam 2.
  • Questions.
• Lab.
• Debrief.

Preliminaries

Admin

• Welcome back! I hope that your breaks were spectacular.
• Quizzes 6-8 returned. More graded work coming soon.

Upcoming Work

• Lab Writeup: Problem 4. http://bit.ly/151-2015S-lab32
• Reading for Tuesday:
  • Turtle Graphics

Extra Credit Opportunities

Academic

• Wedneday, April 1 noon, Scholars Convocation on Implicit Bias.
• CS Table Friday: Therac 25 (readings coming soon)

Peer Support (Morning Section)

• Julia's radio show, "The Hot Box". Wednesday night/Thursday morning 1:00-2:00 a.m. (Topic forthcoming.)

Miscellaneous

• Wednesday evening discussion. (Terrifyingly enough, I get to facilitate one of the discussions.)

Notes on Exam 2

• Exam 2 is graded but will not be returned until Wednesday because a few people have extensions until Tuesday night.
• Academic honesty issue 1: Many students were careless in citing code from readings/labs/homework.
  • You are expected to cite anything that's not the exam.
  • The College does expect me to report failure to cite to the Committee on Academic Standing. Neither you nor I want that to happen.
  • If you neglected to cite because of misunderstanding of polices, please get citations to me by 5pm today.
• Academic honesty issue 2: I received reports of students collaborating on the exam.
  • "I saw some of your students talking about the exam."
  • "I heard the following conversation: 'How do you make the code faster?' 'Use a let.'" (Conversation simulated.)
  • "I don't feel comfortable signing the second statement."
  • Let's treat this in an exercise in self governance. I'll work with both classes on deciding what to do. But you need some time to reflect, so at the start of class on Tuesday, we will discuss how I might handle this issue.

Questions

Lab

Given that the computation of brightness is 0.3*red + 0.59*green + 0.11*blue, why is red the brightest color?

What should our solution to problem 2 look like?

(define irgb-brightest
  (letrec ([kernel (lambda (brightest-so-far remaining)
                     ...)])
    (lambda (colors)
      (cond
        [(null? colors)
         (error "irgb-brightness requires a non-empty list")]
        [(not (list? colors))
         (error "irgb-brightest expects a list, received" colors)]
        ...
        [else
         (kernel (car colors) (cdr colors))]))))

How do we check whether every element of a list is an irgb color?

Refer back to quiz 8.

Refer back to recursion with Booleans.

Debrief