Contents

How to Design Programs: An Introduction to Programming and Computing

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
How to Design Programs: An Introduction to Computing and Programming [Go to first , previous , next page; contents; index ] Contents Preface I Processing Simple Forms of Data 1 Students, Teachers, and Computers 2 Numbers, Expressions, Simple Programs 2.1 Numbers and Arithmetic 2.2 Variables and Programs 2.3 Word Problems 2.4 Errors 2.5 Designing Programs 3 Programs are Function Plus Variable Definitions 3.1 Composing Functions 3.2 Variable Definitions 3.3 Finger Exercises on Composing Functions 4 Conditional Expressions and Functions 4.1 Booleans and Relations 4.2 Functions that Test Conditions 4.3 Conditionals and Conditional Functions 4.4 Designing Conditional Functions 5 Symbolic Information 5.1 Finger Exercises with Symbols 6 Compound Data, Part 1: Structures 6.1 Structures 6.2 Extended Exercise: Drawing Simple Pictures file:///C|/Documents%20and%20Settings/Linda%20Grauer. ..2/How%20to%20Design%20Programs/curriculum-Z-H-1.html (1 of 7) [2/5/2008 4:31:23 PM]
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
How to Design Programs: An Introduction to Computing and Programming 6.3 Structure Definitions 6.4 Data Definitions 6.5 Designing Functions for Compound Data 6.6 Extended Exercise: Moving Circles and Rectangles 6.7 Extended Exercise: Hangman 7 The Varieties of Data 7.1 Mixing and Distinguishing Data 7.2 Designing Functions for Mixed Data 7.3 Composing Functions, Revisited 7.4 Extended Exercise: Moving Shapes 7.5 Input Errors 8 Intermezzo 1: Syntax and Semantics 8.1 The Scheme Vocabulary 8.2 The Scheme Grammar 8.3 The Meaning of Scheme 8.4 Errors 8.5 Boolean Expressions 8.6 Variable Definitions 8.7 Structure Definitions II Processing Arbitrarily Large Data 9 Compound Data, Part 2: Lists 9.1 Lists 9.2 Data Definitions for Lists of Arbitrary Length 9.3 Processing Lists of Arbitrary Length 9.4 Designing Functions for Self-Referential Data Definitions 9.5 More on Processing Simple Lists 10 More on Processing Lists 10.1 Functions that Produce Lists 10.2 Lists that Contain Structures 10.3 Extended Exercise: Moving Pictures 11 Natural Numbers 11.1 Defining Natural Numbers file:///C|/Documents%20and%20Settings/Linda%20Grauer. ..2/How%20to%20Design%20Programs/curriculum-Z-H-1.html (2 of 7) [2/5/2008 4:31:23 PM]
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This test prep was uploaded on 02/06/2008 for the course CS 1102 taught by Professor Fisler during the Spring '07 term at WPI.

Page1 / 7

Contents - How to Design Programs: An Introduction to...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online