Fundamentals of Computer Science I (CS151.01 2006F)

Class 02: An Introduction to CSC151

Back to An Introduction to Algorithms. On to Working in DrScheme.

This outline is also available in PDF.

Held: Monday, 28 August 2006

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

Related Pages:

Due

Notes:

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

Lab: Getting Started in the MathLAN

About This Class

Administrative Issues

Back to An Introduction to Algorithms. On to Working in DrScheme.

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 Thu Nov 30 21:43:18 2006.
The source to the document was last modified on Mon Sep 4 08:43:32 2006.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2006F/Outlines/outline.02.html.

You may wish to validate this document's HTML ; Valid CSS! ; Creative Commons License

Samuel A. Rebelsky, rebelsky@grinnell.edu

Copyright © 2006 Samuel A. Rebelsky. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/2.5/ or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.