Lab Index:

Computer Science 151 is a laboratory-based course that uses collaborative learning extensively. The following list outlines each laboratory exercise for the course.

Laboratory
Exercise	Title and Description
Lab. 1	Getting Started:
	Logging in Use of Windows Changing Your Password
Lab. 2	Beginning Scheme:
	Symbols and Expressions Read-Eval-Print Loop Quote Procedure
Lab. 3	Editing Scheme Files:
	Due Monday, February 1 Simple Editing Operations Symbol and Expression Definition Recording a Workstation Session
Lab. 4	Scheme within XEmacs :
	Symbols as Values Quote Expressions Comments and String Literals
Lab. 5	An Introduction to Lists in Scheme:
	Due Friday, February 5 List Constructors: Cons, Car, Cdr List Literals Common List Operations
Lab. 6	Simple Scheme Predicates:
	Type Predicates Equivalence Predicates Arithmetic and Boolean Predicates
Lab. 7	User-Defined Procedures:
	Due Wednesday, February 10 Lambda Expressions Procedure Definitions Examples
Lab. 8	Conditional Execution in Scheme:
	cond statement if statement Boolean Expressions with and and or
Lab. 9	Recursion: The Basics:
	Introduction to Recursion Recursion on Strings and Lists Examples
Lab. 10-11	Variations on Recursion:
	Due Tuesday, February 16 Recursion for writing filters Recursion for list processing Recursion for numeric processing
Lab. 12	Random Number Generators:
	Use in Chez Scheme Use to Simulate Rolling a Die Use to Simulate Flipping a Coin
Lab. 13	Simulations:
	Multiple Rolls of Dice Flipping a Coin Several Times Flipping Double Heads
Lab. 14	Testing Preconditions:
	Error Procedure Error Recovery in Chez Scheme Examples
Lab. 15	Side Effects and Sequencing:
	Due: Monday, March 1 Output Tracing Begin-expressions
Lab. 16	Patterns:
	Comparing Procedures Applications for Problem Solving Examples
Lab. 17	Flat Recursion:
	List Processing Examples Problem Solving
Lab. 18	Deep Recursion:
	List Processing Mutual Recursion Examples
Lab. 19	Pairs:
	Box-and-Pointer Representation Dot Notation Association Lists
Lab. 20	Trees:
	Conceptual Structure Representation in Scheme Examples and Operations
Lab. 21	Local Bindings:
	Local Variables Let, Let* Examples
Lab. 22	Local Binding and Recursion:
	Due: Wednesday, March 10 Binding Recursive Procedures Let, Let*, Letrec
Lab. 23	Local Procedures:
	Named Let Procedures Recursion and Tail Recursion Examples
Lab. 24	Application: Placing Students Using An Expert Systems:
	The Student Placement Problem Rule-Based Systems Processing Text Files
Lab. 25	Character Data:
	Literals Character Predicates Examples
Lab. 26	Strings:
	String Predicates Zero-Based Indexing Examples
Lab. 27	Input and Output:
	Due: Wednesday, April 7 Interactive Scheme Programs Read and Write Procedures Sentinels
Lab. 28	An Introduction to Files:
	Files as Streams Reading File Data Writing Data to Files
Lab. 29	Processing Lines in Files:
	Reading a Line Line-by-Line Processing Elements of a File I/O Library
Lab. 30	Beginning a File Processing Library:
	Reading Characters Reading a Fixed-Length String Elements of a File I/O Library
Lab. 31	Procedures As Values:
	Procedure? Predicate Map, for-each, apply procedures Examples
Lab. 32	Variable Arity:
	Parameter Declaration Alternative Forms for Lambda Expressions Examples
Lab. 33	Higher-Order Procedures:
	Currying and Uncurrying Operator sections Procedure composition
Lab. 34	Formatted Output:
	Data Conversion: numbers, strings, symbols Formatting Numbers Examples
Lab. 35	Vectors:
	Literals Predicates Standard Procedures
Lab. 36	Structure Mutation:
	Due: Friday, April 30 vector-set! string-set!, set-car!, set-cdr! Examples
Lab. 37	Assignment and Scope:
	Assignment: set! Global and Local Scope Examples
Lab. 38	And Introduction to the World Wide Web and CGI Programming:
	HTML Format Creating and Editing an HTML document An Introduction to CGI and Scheme Programming
Lab. 39	CGI Programming:
	Due: Friday, May 7 CGI and Scheme Programming Query Strings A Directory Example
Lab. 40	Iteration:
	Loops Do Expressions Examples
Lab. 41	Insertion Sort:
	Basic Approach Some Details Iteration and Recursion
Lab. 42	Merge Sort:
	Basic Approach Some Details Analysis
Lab. 43	Searching Methods:
	Linear Search Binary Search Application in a Hi/Low Game
Lab. 44	Object-Oriented Programming:
	Classes and Objects Messages Stacks as Objects
Lab. 45	Queues (Optional):
	FIFO Property Definition Applications
Lab. 46	Object-Oriented Design (Optional):
	Problem Solving Identifying Classes Class Relationships

This document is available on the World Wide Web as

http://www.math.grin.edu/~walker/courses/151.sp99/lab-index.html