Functional Problem Solving (CSC 151 2014F) : EBoards
Primary: [Front Door] [Schedule] - [Academic Honesty] [Disabilities] [Email] - [FAQ] [Teaching & Learning] [Grading] [Rubric] - [Calendar]
Current: [Assignment] [EBoard] [Lab] [Outline] [Reading]
Sections: [Assignments] [EBoards] [Examples] [Handouts] [Labs] [Outlines] [Readings]
Reference: [Setup] [VM] [Errors] - [Functions A-Z] [Functions By Topic] - [Racket] [Scheme Report (R5RS)] [R6RS] [TSPL4]
Related Courses: [Davis (2013F)] [Rebelsky (2014S)] [Weinman (2014F)]
Misc: [Submit Questions] - [SamR] [Glimmer Labs] [CS@Grinnell] [Grinnell] - [Issue Tracker (Course)]
Overview
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.
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)