Fundamentals of CS I (CS151 2002F)

Class 02: Introduction to the Course

Back to Algorithms: Thinking Formally. On to HTML: A Formal Markup Language.

Held Monday, September 2, 2002

Summary

Today, we continue our introduction to the course by discussing the purpose, format, and policies of the course. We also reflect on our activities from the previous class.

Notes

Due

Assignments

Overview

The Parts of an Algorithm

Variables: Named Values

Parameters: Named Inputs

Conditionals: Handling Different Conditions

Repetition

Subroutines: Named Helper Algorithms

About This Class

Paradigms for Problem-Solving

The Need for Formality

Administrative Issues

Why Scheme?

 

History

Thursday, 29 August 2002

Friday, 30 August 2002

Monday, 2 September 2002

 

Back to Algorithms: Thinking Formally. On to HTML: A Formal Markup Language.

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 Mon Dec 2 08:40:45 2002.
The source to the document was last modified on Mon Sep 2 08:02:56 2002.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2002F/Outlines/outline.02.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu