CSC151.01 2014F, Class 27: Recursion with Helper Procedures, Continued
======================================================================

* Continue partners from yesterday

_Overview_

* Preliminaries.
    * Admin.
    * Academic Honesty.
    * Upcoming Work.
    * Extra Credit.
    * Questions.
* Lab.

Preliminaries
-------------

### Admin

* I'll make new cards for tomorrow
* Office hours today and next week
    * Mostly Normal (MTh 1:45-3:15; walking 1:15-1:45); No hours on Friday
    * Added 2:30-3:30 p.m. today (no signup; just walk-in)
    * Mornings I will be in various places.  If you want to find me, email me.
* Quizzes got left on my desk at home.  Sorry.

### Academic Honesty

I think I've been pretty clear that you're not allowed to talk to anyone
other than me or Professor Weinman about the exam.  (There was a slight
confusion with asking tutors about error messages, but I made it clear 
that that's not acceptable and have talked to the students who did not
understand the policy.)

Nontheless, I have reports from both tutors and colleagues that they've 
seen students together at computers working on what seems to be the 151 
exam.  

If you may be one of the people they've observed, you have three options.

* Turn in exam 2 and hope that you're not one of the groups that was observed.
    * If you are, I have no option but to report you to the 
      Committee on Academic Standing.
    * Choosing this option is unethical.
* Don't turn in exam 2.  
    * CAS has told me in the past that they don't consider students to have
      violated our academic honesty policies if they collaborate on work that 
      they don't turn in.  (Collaboration violates my policies whether or not 
      you turn in the work.)
* Try talking to me and then following one of the previous two options.
    * No, I won't tell you if you are one of the groups that was observed.

### Upcoming Work

* Writeup: Problems 4l and 5b (due Friday): <http://bit.ly/151-2014F-w26>
* [Exam 2](../assignments/exam.02.html) due tonight.
    * Epilogue due Wednesday night
* Reading for Wednesday:
    * [List Recursion, Revisited](../readings/list-recursion-revisited-reading.html)

### Extra Credit Opportunities

#### Academic

* BCC Faculty Chat, Tuesday, October 14, 7pm
* CS Table, Friday: Hear about the Grace Hopper Celebration of Women
  in Computing.

#### Peer Support

* Football (Saturday at 1pm)
* Swimming October 18: Alumni Weekend
* Karan's radio show 11pm Thursday nights on KDIC
* Evan's radio show 5pm Friday nights on KDIC
* Donna's radio show Sunday midnight on KDIC
* Men's Tennis (???)
* Women's Tennis (???)

### Questions

_In order to solve the color-cycle problem, I need to be able to find
 the length of a list.  I only know a recursive way to find the length
 of a list.  You told me not to use recursion.  What should I do?_

> Use `length` (which we seem to have left out of the reference pages)

Lab
---

* Note that DrRacket saves backup files that end with a tilde.  Don't
  try to open those files!