Approximate Syllabus

First Day

Introduction [10 minutes]

An introduction to computer science and to the labs, given in Sam's traditional (lecture + discussion + recitation) format.

Exercises 1: PBJ Algorithm and 2: PBJ Algorithm, Revised [30 minutes]

Students write an algorithm (instructions) for making a peanut butter and jelly sandwich. Sam tries to follow the instructions as a computer might. Students try again. We reflect on common algorithm components.

Exercises 3:Designing A Sorting Algorithm and 4: Designing a Second Sorting Algorithm [30 minutes]

Students write algorithms to sort a collection of books/CDS/etc.

Exercise 5: Starting Scheme [40 minutes]

Students play with some Scheme basics.

Reflection [10 minutes]

Students reflect on what they've learned so far.

Overnight

Review: Today's material

Scan through the handouts that correspond to today's discussion and your notes from the discussion.

Read: Some Standard Sorting Algorithms

Second Day

Review [10 minutes]

Students ask Sam questions. Sam asks students questions.

Exercise 6: Comparing Algorithms [10 minutes]

We'll approach this exercise as a discussion question.

Exercise 7: Selection Sort [30 minutes]

Students run and test an implementation of selection sort. Students also experimentally determine a formula for the running time of selection sort.

Exercise 8: Formalizing Requirements [20 minutes]

Using discussion format, students work to come up with a formal definition for what it means to remove a particular element from a list, as in selection sort.

Exercise 9: Comparing Sorting Algorithms [40 minutes]

Students experimentally compare three sorting algorithms.

Reflection [10 minutes]

Students reflect on what they've learned over the two days.

If There is Extra Time

Exercise 10: Finding the Largest Value

Working from a Scheme procedure to find the smallest value in a list, students build a Scheme procedure fo find the largest value in a list. They then generalize to find the best value in a list. We'll do this exercise as a group.