In-class Examples List
CS 131
Intro to Computer Science I
Fall 2002
this page last modified: 12-13-02
Important Notes:
- This is merely a selection of files and examples, most of which were
mentioned or used in the class. It is not a comprehensive
list, nor are all lectures and labs included. Formatting is generally
minimal.
- Week 15, Lecture 2, December 12, 2002: final review,
more discussion of set! and begin (with some vector-related
examples thrown in)
- Contents of
Scheme definitions window as built in lecture,
including a few more set! and
begin-related examples, sum-vector2 using set! and
begin, and binary search using vectors.
- Final Examination
study suggestions (in Rich Text Format (rtf))
- Week 15, Lecture 1, December 10, 2002: intro to
vectors, intro to set! and begin (changing variables)
- vector-related
examples - examples involving Scheme vectors,
Scheme's version of ARRAYS. Note the
example using build-vector at the
end (added after lecture, based on after-class
questions)
- set! and begin -
examples involving set! (which can change a defined
variable's value) and begin
- Week 14, Lecture 2, December 5, 2002: continue intro to
GUI's
- GUI example #1 -
review of last example from Week 14 Lecture 1: a
window with a button that hides the window
- GUI example #2 -
example with a textfield and a message field
- GUI example #3 -
example with a choice menu
- GUI example #4 -
adding a GUI to an earlier example (from Week 11 Lecture
2 and Week 12 Lecture 1): finding the
instruments corresponding to rock stars
- GUI example #5 -
replacing the textfield used to enter star's names
in GUI example #4 with a choice menu populated from
the list of stars itself
- Week 14, Lecture 1, December 3, 2002: continue
structural vs. generative recursion, start intro to GUI's
- Contents of
Scheme definitions window as built in lecture,
including termination arguments for move-until-out
and qsort, and description of some of the elements
of DrScheme's gui.ss teachpack, including a very simple
first example.
- Week 13, Lecture 2, November 21, 2002: continue
structural vs. generative recursion
- Contents of
Scheme definitions window as built in lecture,
including rolling-ball-modelling
move-until-out and all of its data definitions
and auxiliary functions, and qsort (quicksort) and
its data definition and auxiliary function.
- Week 13, Lecture 1, November 19, 2002: continue
functions working on functions (Sections 19, 21), start
structural vs. generative recursion (Sections 25-26)
- Contents of
Scheme definitions window as built in lecture,
including equal? examples, parametric data definition
for listof, instr-equals?, filter1 redux, examples of
use for a number of Scheme built-in abstract functions
for list processing
- Week 12, Lecture 2, November 14, 2002: continue
functions working on functions (Sections 19, 21)
- Contents of
Scheme definitions window as built in lecture,
including below, above, filter1, filter2
- Week 12, Lecture 1, November 12, 2002: continue
Intermezzo 3/Section 18: Local definitions and lexical scope,
start functions working on functions (Sections 19, 21)
- Contents of
Scheme definitions window as built in lecture,
including first-occurrence, last-occurrence, mult10
- Week 11, Lecture 2, November 7, 2002: continue
Intermezzo 3/Section 18: Local definitions and lexical scope
- Contents of
Scheme definitions window as built in lecture,
including sort using local, flash-and-clear, first-occurrence,
last-occurrence
- Week 10, Lecture 2, October 31, 2002: Midterm #2 review, and begin
Intermezzo 3/Section 18: Local definitions and lexical scope
- Week 10, Lecture 1, October 29, 2002: Section
12, HtDP (auxiliary recursive functions)
- Contents of
Scheme definitions window as built in lecture,
including examples of append function use and functions
insert and sort.
- Handout describing
function append, Partial-Homework-Amnesty Experiment,
advice/tips/guidelines about when to make an auxiliary function,
and more.
- Week 9, Lecture 2, October 24, 2002: Continuing section
11, HtDP (natural numbers)
- Contents of
Scheme definitions window as built in lecture,
including functions many-sym, list-of-x-nums, draw-num-drops,
and ! (factorial)
- Week 9, Lecture 1, October 22, 2002: Intermezzo 2, starting section
11, HtDP (natural numbers)
- Contents of
Scheme definitions window as built in lecture,
including list abbeviation examples and function many-sym
- Week 8, Lecture 2, October 17, 2002: continuing with lists
(Section 10, I think, HtDP)
- Contents of
Scheme definitions window as built in lecture,
including examples incr-grade and return-Xth
- Week 8, Lecture 1, October 15, 2002: continuing with lists
(Sections 9-10, HtDP)
- Contents of
Scheme definitions window as built in lecture,
including example using a list of structures.
- Week 7, Lecture 2, October 10, 2002: continuing with lists
(Section 9, HtDP)
- Contents of
Scheme definitions window as built in lecture,
including first RECURSIVE functions,
contains-symbol? and list-length
- Week 7, Lecture 1, October 8, 2002: finished "official" coverage
of "How to Design Programs" section 7, and since we have
pretty much covered section 8: Intermezzo 1, already,
we started section 9: lists.
- Contents of
first Scheme definitions window as built in lecture,
including shape data definition and example of using
Scheme error function
- Contents of
second Scheme definitions window as built in lecture,
including first list-related examples
- Week 6, Lecture 1, was Midterm #1, and
Week 6, Lecture 2 was cancelled due to conference travel.
- Week 5, Lecture 2, September 26, 2002: started coverage of
"How to Design Programs" section 7: predicates; followed by
review for Midterm #1.
- Contents of
Scheme definitions window as built in lecture,
with slightly-diff-circle function CORRECTED
9-30-02, as described in e-mail;
- Week 5, Lecture 1, September 24, 2002: continued coverage of
structures ("How to Design Programs" section 6, through p. 79);
includes demonstrations of more draw.ss functions.
- Contents of
Scheme definitions window as built in lecture
- Week 4, Lecture 2, September 19, 2002: continued coverage of
structures ("How to Design Programs" section 6, through p. 79)
- Week 4, Lecture 1, September 17, 2002: started coverage of
symbols and structures ("How to Design Programs" section 5, through
p. 51, and section 6, through p. 79)
- Contents of
Scheme definitions window as built in lecture
- Week 3, Lecture 2, September 12, 2002: completed coverage of
conditionals ("How to Design Programs" section 4, through p. 46)
- Contents of
Scheme definitions window as built in lecture and completed
after lecture
- Week 3, Lecture 1, September 10, 2002: started coverage of
conditionals ("How to Design Programs" section 4, through p. 46)
- Contents of
Scheme definitions window as built in lecture and completed
after lecture
- Week 2, Lecture 2, September 5, 2002: mostly coverage of
"How to Design Programs" sections 2-5 to 3.3 (through p. 28)
- Contents of
Scheme definitions window as built in lecture and completed
after lecture
- Week 2, Lecture 1, September 3, 2002: continued coverage of
"How to Design Programs" through section 2.4 (through p. 16)
- Contents of Scheme
definitions window at the end of lecture - MODIFIED
9-4-02 to include additional functions needed for HW #2
- Week 1, Lecture 2, August 29, 2002: began coverage of "How to Design
Programs" through section 2.4 (through p. 16)
- Contents of Scheme
definitions window at the end of lecture
Back to Course Home Page
Please send questions to
st10@humboldt.edu .