CSC 161 | Grinnell College | Fall, 2011 |
Imperative Problem Solving and Data Structures | ||
This module introduces CSC 161 students to fundamental elements of programming in C, including
Day | Topic | Preparation | In-class | Due Date | Availability for Extra Credit |
---|---|---|---|---|---|
Monday, September 19 | Examples Module 2: Arrays, Functions, Testing, Values, and Addresses | Examples: | |||
Tuesday, September 20 | Arrays |
| lab exercise | ||
Wednesday, September 21 | Functions |
| lab exercise | ||
Friday, September 23 | Hour Test 1 | ||||
Monday, September 26 | The & Operator and Addresses |
| lab exercise | ||
Tuesday, September 27 | Testing | ||||
Wednesday, September 28 | Project | Uninterpretable Dance | Due: |
Working in pairs, students should develop a program which makes the robot perform a randomized dance. That is, the program should have these features:
This project will be worth 25 points, based on the following rubric:
The dance has at least 5 unique dance sequence functions (5 points)
The dance is properly randomized (5 points)
The program uses arrays and pass-by-reference calling of functions with array parameters (5 points)
Evidence of testing is included (5 points)
The dance sequences are creative (5 points).
This document is available on the World Wide Web as
http://www.walker.cs.grinnell.edu/courses/161.fa11/modules/module-arrays-functions/module-arrays-functions.shtml
created 19 July 2011 by Dilan Ustek last full revision 26 July 2011 by Dilan Ustek dates revised 2 September 2011 by Henry M. Walker |
![]() ![]() |
For more information, please contact Henry M. Walker at walker@cs.grinnell.edu. |