CS1321 - David Smith's Stuff

General

• America the Beautiful
• Sir Winston Churchill
• humor

Scheme Resources

• Scheme code
• Text: "How to Design Programs"

Introduction

• Day 1
• Scheme
• Cheating Lecture

Part I - Processing Simple Forms of Data

• Part I Section 1.1 - Paradigms
• Part I Section 2.1 - Numbers and Arithmetic
• Part I Section 2.4 - Basic Syntax
• Part I Section 2.5 - Designing Programs 
• Part I Section 3.1 - Composing Functions
• Part I Section 3.1a - Abstraction 
• Part I Section 3.2 - Variables again 
• Part I Section 4.0 - Web Work 
• Part I Section 4.1 - Boolean Expressions 
• Part I Section 4.3 - Conditionals 
• Part I Section 5.0 - Symbols 
• Part I Section 6.2 - Simple Pictures 
• Part I Section 6.3 - Structures 
• Part I Section 7.1 - Mixing Data 

Part II - Processing Arbitrarily Large Data

• Part II Section 9.0a - Computer Model 
• Part II Section 9.0b - Activation Stack 
• Part II Section 9.0c - Recursion 
• Part II Section 9.1 - Lists 
• Part II Section 9.3 - Recursion on Lists 
• Part II Section 10.1 - Producing Lists 
• Part II Section 12.1 - Designing Complex Programs 

Part III - More on Processing Arbitrarily Large Data

• Part III Section 14.1 - Trees 
• Part III Section 14.2 - BSTs
• Part III Section 14.2c - BST Search
• Part III Section 14.2d - BST Insert
• Part III Section 14.3 - Compound Structures
• Part III Section 15.2 - Designing for Mutual Reference
• Part III Section 16 - Iterative Refinement
• Part III Section 17.1 - Append
• Part III Section 17.2 - Revenue
• Part III Section 17.3 - Indexing
• Part III Section 17.6 - Merge
• Part III Section 17.8 - Equality

Part IV - Abstracting Designs

• Part IV Section 19 - Abstracting Designs
• Part IV Section 22.0 - (let ...)
• Part IV Section 21.2 - Abstract List Functions
• Part IV Section 22.3 - Graphical User Interfaces

Part V - Generative Recursion

• Part V Section 25.0 - Generative Recursion
• Part V Section 25.2a - Merge Sort
• Part V Section 25.2b - Quick Sort
• Part V Section 27.1 - Fractals
• Part V Section 27.2 - Files as Lists
• Part V Section 27.3 - Binary Search
• Part V Section 28.1 - Graphs
• Part V Section 28.1a - More on Graphs
• Part V Section 28.1b - Paths in Graphs
• Part V Section 28.1c - Minimal Spanning Trees
• Part V Section 29.0a - Iteration
• Part V Section 29.3a - Vectors
• Part V Section 29.3b - Big O

Part VI - Accumulating Knowledge

• Part VI Section 30 - Local 
• Part VI Section 31 - Accumulator Functions  

Part VII - Changing the State of Variables

• Part VII Section 35.2 - Assignment and Sequencing 
• Part VII Section 36 - Functions with Memory 

Part VIII - Changing Compound Values

• Part VIII Section 39 - (local ... )
• Part VIII Section 39 - Objects
• Part VIII Section 39 - Coke Machine Example
• Part VIII Section 39 - Polymorphism
• Part VIII Section 39 - Inheritance