Fundamentals of Computer Science 1 (CS151 2003S)
[Skip to Body]
Primary:
[Front Door]
[Current]
[Glance]

[EC]
[Honesty]
[Instructions]
[Links]
[Search]
[Syllabus]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Lab Writeups]
[Outlines]
[Project]
[Readings]
[Reference]
ECA:
[About]
[Grades]
[Quizzes]
[Submit Work]
[Change Password]
[Reset Password]
Misc:
[Scheme Reference]
[Scheme Report]
[CS151 2003S Gum]
[CS151 2002F]
[CS151 History]
[SamR]
Back to Introduction to the Course. On to HTML: A Formal Markup Language.
Held: Tuesday, 21 January 2003
Summary: We continue our introduction to Computer Science by trying to formally give instructions for an everyday problem.
Due
Assignments
Notes:
The word algorithm is derived from the last name of Abu Ja'far Muhammad ibnMusa AlKhowarizmi, a famous Persian mathematician and author of the 8th and ninth centuries. AlKhowarizmi was a teacher at the Mathematical Institute in Baghdad and the author of the book Kitab al jabr w'al muqabala, which in English means
Rules of Restoration and Reduction.It was one of the earliest mathematical textbooks, and its title gave us the world algebra (the Arabic word al jabr meansreduction).In [C.E.] 825, AlKhowarizmi wrote another book about the base10 positional numbering system that had recently been developed in India. In this book, he described formalized, stepbystep procedures for doing arithmetic operations, such as addition,s ubtraction, and multiplication, on numbers represented in this new decimal system. In the twelfth century this book was translated into Latin, introducting the base10 HinduArabic numbering system to Europe, and AlKhowarizmi's name became closely associated with these formal numerical techniques. When written in Latin characters rather than Arabic, his last name became rendered as Algorismus, and eventually the formalized procedures that he pioneered and developed became known as algorithms in his honor. (Schneider and Gersting, An Invitation to Computer Science, 2nd Edition, 1998, p. 7).
Overview:
follower of instructions.
the piece of bread in your left hand.
breadleft.
find square rootalgorithm would take a number as input.
look up a telephone numberalgorithm might take a phone book and a name to lok for as inputs.
reasonable(we can't find the square root of a piece of bread and we can't make a PBJ sandwich with tunafish).
repetition.
subroutines.
Thursday, 16 January 2003 [Samuel A. Rebelsky]
Tuesday, 21 January 2003 [Samuel A. Rebelsky]
Back to Introduction to the Course. On to HTML: A Formal Markup Language.
[Skip to Body]
Primary:
[Front Door]
[Current]
[Glance]

[EC]
[Honesty]
[Instructions]
[Links]
[Search]
[Syllabus]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Lab Writeups]
[Outlines]
[Project]
[Readings]
[Reference]
ECA:
[About]
[Grades]
[Quizzes]
[Submit Work]
[Change Password]
[Reset Password]
Misc:
[Scheme Reference]
[Scheme Report]
[CS151 2003S Gum]
[CS151 2002F]
[CS151 History]
[SamR]
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 May 6 09:29:31 2003.
The source to the document was last modified on Tue Jan 21 12:17:09 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2003S/Outlines/outline.02.html
.
You may wish to validate this document's HTML ; ; Check with Bobby
Samuel A. Rebelsky, rebelsky@grinnell.edu