Fundamentals of Computer Science I (CS151 2003F)

Class 02: An Introduction to CSC151

Back to An Introduction to Algorithms. On to HTML, A Formal Markup Language.

Held: Friday, 29 August 2003

Summary: Today we begin to consider the structure and content of the course.

Related Pages:

Assignments

Overview:

Reflections on the PB and J Problem

Left for you to fill in the details.

The Parts of an Algorithm

Variables: Named Values

Parameters: Named Inputs

Conditionals: Handling Different Situations

Repetition

Subroutines: Named Helper Algorithms

About This Class

Paradigms for Problem-Solving

The Need for Formality

Administrative Issues

 

History

Thursday, 28 August 2003 [Samuel A. Rebelsky]

 

Back to An Introduction to Algorithms. 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 Tue Dec 9 13:59:30 2003.
The source to the document was last modified on Mon Sep 1 13:30:51 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2003F/Outlines/outline.02.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu