[an error occurred while processing this directive]
[an error occurred while processing this directive]
Comp 200
[an error occurred while processing this directive]
[an error occurred while processing this directive]
Comp 200:
Computer Science for Poets
Comp 200 addresses the question
"What is Computer Science?",
giving a broad overview of some of the main concepts in the field.
It is intended for people who
don't (necessarily) plan on becoming C.S. majors or hot-shot programmers,
but want to know more about what computation is, and why people study
the notion of computation.
Comp 200 is a Group III Distribution course.
For further overview, see the flyer.
You can also look at the web page from
00.spring.
Related courses of interest are
Comp 210,
Principles of Computing and Programming
(enjoyed by science and non-science majors alike),
Comp 100
(intro information technology,
databases and spreadsheets, tools for web authoring, etc.),
or
Comp 300,
information technology and its effects on society.
Office Hours
You may also send e-mail, if you want to try to schedule a different time.
Mail to comp200@rice will go to
both
of the above.
Course Material:
- Lecture Notes
(meant primarily for the prof to lecture from,
but may be helpful to you.)
- The Newsgroup
- General Information (postscript)
(hours, homework policy, etc.)
- Supplemental Reading
-
If you can read news and send mail and find the web page,
that's all the computer skills you'll need.
But if you want to do more with your owlnet UNIX account,
check out
Intro Unix handout (ps), or
Mudd's
Unix single-afternoon classes.
- Intro to Netscape, News
and
Intro to Dr.Scheme
- Homework 1: Finger exercises
Solution
- Homework 2: Recursive functions; due Feb.07 (wed)
Solution
- Reading jan.19-24:
Harel: chpt 1; chpt 2: pp 25-33 only.
- Homework 3: insert, timesHalved (due 01.feb.21
(wed))
-
Reading jan.26-31:
Hofstadter, Chapter 17.
See the
lecture 6 notes for
translations of
car,nil, and the like
into first, empty, etc.
-
Reading jan.31-feb.04:
Hofstadter, Chapter 18.
-
Reading feb.16-23:
Harel pp 41-46 (trees); chpt 6.
optional: Hofstadter, chpt 19 ((mutual) recursion).
-
The FamTree teachpack is ready.
-
Lab:
measuring sorts
(01.Feb.28)
- Homework 4: binary numerals; running time
(due 01.mar.14 (wed))
-
Reading: Harel chpt 7: read pp 161-175; skim the rest of the chapter.
Optional reading: Hofstadter chpt 6 (Number Numbness).
- Homework 5: reductions
(due 01.apr.02 (mon))
Solutions
- Project Possibilities
- Homework 6:
randomized algorithms; circuits
Solutions
You can
look up your
scores;
let us know asap if there are any mistakes.
[an error occurred while processing this directive]