[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Outlines] [Labs] [Assignments] [Quizzes] [Questions] [Exams] [Examples]
Back to Logical vs. Physical Formatting, Revisited. On to The Parts of an Algorithm.
Held Wednesday, February 2, 2000
Overview
Today, we move on to the study of algorithms. We begin by considering the various ways that programmers tell computers to do things. We then consider a sample ``real world'' algorithm: building a sandwich.
Question 7 for today's class: Unambiguously describe how to make a peanut butter and jelly sandwich.
Question 8 for tomorrow's class: Describe unambiguously how to find the lowest grade in a list of grades.
Notes
Contents
Summary
Saturday, 22 January 2000
Wednesday, 2 February 2000
Back to Logical vs. Physical Formatting, Revisited. On to The Parts of an Algorithm.
[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Outlines] [Labs] [Assignments] [Quizzes] [Questions] [Exams] [Examples]
Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.
This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS105/2000S/Outlines/outline.07.html
Source text last modified Wed Feb 2 09:45:25 2000.
This page generated on Wed Feb 2 09:51:20 2000 by Siteweaver. Validate this page's HTML.
Contact our webmaster at rebelsky@grinnell.edu