Procedures are used to enable the programmer to divide the procedural aspects of a problem in parts, and hide the implementation details of a given subproblem. Principle mechanismes such as local variables and block structures are explained. Important procedural phenomena like recursion and iteration are introduced. Using some examples, the procedural cost are expressed as Order of Growth.

MUST | |||

SICP 1.1.8 | Procedures as Black-Box Abstractions | 2.1 | Procedural Abstraction |

2.2 | Local Name | ||

2.3 | Bound Variable | ||

2.4 | define within define | ||

2.5 | Block Structure | ||

SICP 1.2 | Procedures and The Processes They Generate | 2.6 | Procedure vs Process |

SICP 1.2.1 | Lineair Recursion and Iteration | 2.7 | Recursive Process and Deferred Operations |

2.8 | Iterative Process and State Variables | ||

SICP 1.2.2 | Tree Recursion, until Example: Counting Change | 2.9 | Tree Recursion |

SICP 1.2.3 | Order of Growth | 2.10 | O(f(n)) |

SHOULD | |||

SICP 1.2.4 | Exponentiation | Example of Order of Growth | |

SICP 1.2.5 | Greatest Common Divisors | Example of Order of Growth | |

COULD | |||

SICP 1.2.2 | Tree Recursion, from Example: Counting Change | Example Tree Recursion | |

SICP 1.2.6 | Example: Testing for Primality | Extended example of everything in this session |

10

Fri Jun 5 18:56:04 MET DST 1998