This schedule provides a tentative outline of each class period and links to handouts given in class. It is expected to change over the course of the semester.

• 1/9: Survey of interests and abilities. Getting and using a UIC email account. Introduction to interpreted language and LOGO. Practice using simple LOGO commands (left, right, forward, back, penup, pendown, clearscreen, repeat, bye). Discussion of math concepts used in the exercises.
• 1/16: Discussion of homework. Exploration of procedure definitions, repeated squiggles and the total turtle trip theorem. Tour of LOGO generated repeating patterns. "Outside In" video. More advanced LOGO procedures and how to save and load them.
• 1/23: Recursion. Review of homework: Zeep erases the blackboard. Changing the path of a program using if and else statements. (Commands covered this period.)
• 1/30: Review of homework. Excercise on formatting output and checking input. Discussion of reporters in LOGO. Identification of frieze patterns activity. Return to IFELSE using NOT, AND and OR. (Commands covered this period.)
• 2/6: Review for midterm. Starry polygons and "the rest of" the basic LOGO commands -- pencolor, position, etc.
• 2/13: Question and answer session. Midterm 1. Drawing a garden. Commands used this period.
• 2/20: Lists in LOGO. Talk on "Teaching Outside the Lines" by Avani Khandhar. Impromptu discussion of recursion. Commands used this period.
• 2/27: The make command in LOGO. Discussion of project planning. Arrays and FOR loops in LOGO. Commands used this period.
• 3/6: Discussion of LOGO exercises created as homework. Graphing with LOGO. Assignment of LOGO programming tasks. The WHILE command. A quick introduction to sorting algorithms. Commands used this period.
• 3/20: Solution to homework problem 3. A sample sort procedure. Pseudocode and flowcharts. An impractical demonstration of the bubble sort algorithm. Review for midterm.
• 3/27: Questions about Midterm 2. Midterm 2. Recursive drawing of fractal trees.
• 4/3: Discussion of bubble sort. Practice debugging in LOGO. Discussion of final projects. The READWORD and READLIST commands and interactive LOGO programming. Commands used this period.
• 4/10: The Euclidean Algorithm for finding the greatest common divisor and its relation to starry polygons. Discussion of homework and playing of games. Using LOGO to draw frieze patterns.
• 4/17: Discussion of homework and recursive returns activity. Graph theory and Dijkstra's Algorithm. More repeating patterns.
• 4/24: Review for the final. Approximating Pi. Doing geometry with coordinates, vectors and matrices in LOGO.
• 5/1: Short review session. Final exam.