Programming Languages (CS302 2007S)
[Skip to Body]
Admin:
[Front Door]
[Glance]
[Handouts]
[Honesty]
Current:
[Current Outline]
[Current EBoard]
[Current Homework]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Outlines]
[Readings]
[Reference]
[HOG]
Misc:
[SamR]
[CSC302 1999S]
[CSC302 2006S]
This outline is also available in PDF.
Held: Monday, January 29, 2007
Summary: Today we consider the basics of structured programming and the reasons it supplanted goto-ridden programming.
Related Pages:
Notes:
Overview:
Some of these notes come from Dijkstra's What Led to
(EWD1308). Available at
Notes on
Structured Programming
http://www.cs.utexas.edu/users/EWD/transcriptions/EWD13xx/EWD1308.html
.
closer to the problem?
A Case Against Go to
a (mixed) sequence of textual and/or dynamic indices?
coordinate?
number of people in the roomexmaple?
ownvariables?
L4: if a[i] = p then go to L2; if a[i] < p then r := i; L5: i := i-1; go to L4; L2: ...
[Skip to Body]
Admin:
[Front Door]
[Glance]
[Handouts]
[Honesty]
Current:
[Current Outline]
[Current EBoard]
[Current Homework]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Outlines]
[Readings]
[Reference]
[HOG]
Misc:
[SamR]
[CSC302 1999S]
[CSC302 2006S]
Disclaimer:
I usually create these pages on the fly
, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Sun Apr 29 11:25:51 2007.
The source to the document was last modified on Tue Jan 16 13:34:42 2007.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS302/2007S/Outlines/outline.04.html
.
You may wish to validate this document's HTML ; ; Check with Bobby
Samuel A. Rebelsky, rebelsky@grinnell.edu