Complete Announcements - 6.001
-
"Structure and Interpretation of Computer Programs", the text for the
course, is available online (link below), or at Quantam
Books, for about $64. It is also available at the
MIT Coop. You may also find the BookTrack site
a useful source for ordering books.
- During recitations on February 3rd, we will be gathering
information which we will use to assign recitation sections. For that
first day of recitation, please attend the recitation to which the
registrar assigned you. The new
assignements, based on our reorganization, will be posted on this web
site web later on Wednesday, or possibly Thursday. Starting Friday, February 5th, please attend the
recitation to which WE assign you, based on those posted
assignments. If you have a conflict with
our assignment and only if you have a conflict with that time
then you should contact the course secretary by email to arrange for a
new assignment.
During recitation you will complete an informational form that will
help us assign tutorials. Do not email the course secretary about
section changes until after sections are posted.
Resources for the material.
This term we are providing several resources for the course
material for you.
- You can reach the online version of the text book
(see the link below).
- You can use the lecture based "text book" by going to the tutor,
clicking on the Lecture link, and then for each lecture, using the
"lecture slides in pdf" link. This provides you a version of the
slides of the online lectures, together with associated text
descriptions. While these lectures are NOT identical to the
live lectures, they cover similar material and give you a different
perspective.
- You can access copies of the lectures slides of the actual live
lecture, by clicking on the lecture link in the course calendar (see
link below).
May 3, 2006: Clarification for Project 4
It appears that many of you are struggling with finding a way to
use the ERUMPO-LUMINARIUM method to implement UNDULUM-ARMO. Don't
worry about this. If you have to implement UNDULUM-ARMO more
directly, that's fine.
May 2, 2006: Intro to EECS II
Prof. Sodini this morning briefly described the new subject in
Course VI to be piloted this fall. You can find a flyer about this
course here.
April 27, 2006: Quiz 2 statistics
Here are statistics for Quiz 2:
- Mean: 75
- Max: 100
- Min: 21
- Median: 79
- Deviation: 18
ROUGH grade guidelines are:
April 24, 2006: Revised due date
- Because many students have had a hectic week of quizzes, we have
moved the due date of the first part of Project 4 back to this coming
Friday.
April 20, 2006: Quiz 2 review sessions
- The Lab Assistants will be holding review sessions for the second quiz
in 32-124 on Sunday, April 23 and on Monday, April 24, 7:00 - 9:00pm.
April 20, 2006: Quiz 2 details
- The second quiz for 6.001 will be held on April 25th, from 7:30PM to
9:30PM. You may bring two sheets (8.5 by 11 inches) of notes to the
exam, otherwise it is closed book.
- Students whose last name begins with the letters A to M will take
the exam in 34-101.
- Students whose last name begins with the letters N to Z will take
the exam in 32-123.
- If you have a conflict with this time, there is a conflict exam
scheduled for April 24th from 3 to 5, in 56-154.
If you need to take the conflict exam, you must contact Donna Kaufman
(dkauf@mit.edu) to let her know.
April 18, 2006: Exam solutions
- Example solutions for Quiz 1 may be found here
April 12, 2006: Lecture on April 20th cancelled
- There will not be a lecture on Thursday, April 20th. You
are encouraged to spend the time reading the material in project 4,
since you will need to understand it well to do the project.
April 9, 2006: Project 4 typo
- If you have already downloaded Project 4, note that the plan for your addition should be sent to your TA by April 26th, not April 6th as originally listed.
April 9, 2006: Project 4 released
- Project 4 has been released on the projects page.
April 1, 2006: Minor correction in project
- There's a minor typo in the project: in a few places we refer to
the procedure parse where we should have referred to parse2.
In particular, in Question 12 and Problem 8 where you see (parse ...)
it should read (parse2 ...).
March 31, 2006: Course VI Freshman Open House
- Friday, April 7, 2006
- 3:30-5:00 PM
- 34-401
- FREE Course VI T-Shirts (while supplies last) and Department
Memorabilia (including the brand new department eraser)
- Faculty Research Presentations
- Robot Competition Demonstrations
- LOTS of Food!
- Faculty and staff to meet
- New Flyers and brochures about Course VI
- ALL freshmen are warmly invited, especially those who have decided to or are thinking about majoring in Course VI!
March 21, 2006: Quiz 1 statistics
Here are statistics for Quiz 1:
- Mean: 75
- Max: 100
- Min: 27
- Median: 77
- Deviation: 17
ROUGH grade guidelines are:
March 17, 2006: Project 3 released
Project 3 has been released on the projects page.
March 14, 2006: Project 2 clarification
In project 2 question 3, the procedure nback is specified as:
- returning a #t if the passed list has less than n elements
- returning a procedure f(y) where (y) is the nth element.
A more correct version of the second statement is:
-
returning a procedure f(y) where (y) is the sublist
of the passed list starting from the nth element.
March 3, 2006: Quiz 1 review sessions
Review sessions for quiz 1 will be held by the Lab Assistants as
follows:
- DATE: Sunday, March 5, 2006
- TIME: 7:00 PM to 9:00 PM
- ROOM: 4-159
- DATE: Monday, March 6, 2006
- TIME: 7:00 PM ? 9:00 PM
- ROOM: 32-124
Also note that there is a web site with Lab information at
scripts.mit.edu/~6.001/
including pointers to old quizzes.
March 2, 2006: Quiz 1 coverage
Quiz will cover material up to and including Lecture 6 (Higher
Order Procedures). It will not cover the use of map, filter
or foldr however.
February 26, 2006: Quiz 1 details
The first quiz for 6.001 will be held on March 7th, from 7:30PM to
9:30PM. You may bring one sheet (8.5 by 11 inches) of notes to the
exam, otherwise it is closed book.
- Students whose last name begins with the letters A to M will take
the exam in 34-101.
- Students whose last name begins with the letters N to Z will take
the exam in 32-123.
If you have a conflict with this time, there is a conflict exam
scheduled for March 7th from 3 to 5, in 24-121. If you need to take
the conflict exam, you must contact Donna Kaufman (dkauf@mit.edu) to
let her know.
February 24, 2006: Project 2 released
Project 2 has been released on the projects page.
February 21, 2006: Project 1 clarification
A few students have been confused about part 6 of the project. In
this part a good-bag is a bar that has 10 smarties when the bag is
generated at random using the parameters n and p. Thus, for example,
you would generate m random bags of n smarties (using p) and test to
see whether any one bag has at least 10 orange smarties (which would
make it a good bag).
February 20, 2006: Saving your project
When you are ready to save your project submission, in order to submit
onto the online system, you should save your definitions window or
interactions window in DrScheme using the option of "Save
Definition/Interaction As Text". Doing so prevents DrScheme from
saving the buffer as binary files. If you submit a binary file, the
online submission system will not accept your file.
February 20, 2006: Project 1 clarification
Some students have asked about problem 4 on project 1. The problem asks
for a "recursive procedure". We wanted to clarify that it's absolutely fine if
you've written a procedure that leads to an iterative algorithm.
Here's a little more about the recursive/iterative distinction (lecture 3
talks about this):
We call any procedure that makes a call to itself a *recursive procedure*.
Both fact and ifact-helper (see the lecture) are "recursive procedures" as they
both make calls to themselves. For example, if we have
(define ifact-h (lambda (product count n)
(if (> count n) product
(ifact-h (* product count) (+ count 1) n))))
then this is a recursive procedure, because ifact-h includes a call
to itself in the body of the procedure.
We make a distinction, however, between recursive and iterative
*algorithms*. fact (in lecture 3) gives a recursive algorithm. ifact
gives an iterative algorithm.
Basically, in scheme, recursive *procedures* are extremely common: in
many cases, you'll see an iterative algorithm implemented with a
recursive procedure.
February 17, 2006: Project 1 correction
There is a minor error in the released project (which has been replaced).
An earlier release of the project had a typo in two of the test
cases. The last two test cases for atleast-b-smarties now read
as the following:
(atleast-b-smarties 10 5 0.6)
(atleast-b-smarties 15 5 0.3)
The old version of the project had the following cases, which are
incorrect
(atleast-b-smarties 10 0.6 5)
(atleast-b-smarties 15 0.3 5)
February 10, 2006: Project 1 released
Project 1 has been released on the projects page.
February 9, 2006: Revised section assignments posted
- New section assignments are posted
here. Please check this for your section.
February 7, 2006: Section assignments posted
- Note that section assignments are posted
here. Please check this for your section, and attend that section
starting tomorrow.
February 7, 2006: Problem set due dates
- Several students have asked about problem set due dates. First,
note that the due dates for projects are posted on the calendar. The
first major project will be released this Friday. For the online
tutor problems, the due dates are also posted on the calendar.
However, if you have looked at the first problem set, you will see
that some problems are due earlier. In general, "lecture" problems
will be due before the associated recitation (these are marked on the
problem set page), and the more general problems will typically be due
on Tuesdays
February 7, 2006: Using DrScheme
- When you have downloaded DrScheme onto your computer, you will
discover upon starting the system that you have a choice of
"languages" to use; these are different variants of the Scheme
language with different features enabled or disabled. We recommend
that you use the PLT Pretty Big option.
February 7, 2006: First project released
- Please note that Project 0 (a fairly simple one intended to get
you used to the system we are using in 6.001) has been released on the
projects page of the web site. Please note the instructions for
turning this in. However, please don't turn it in until Friday (as we
need to set up our web system to handle submissions so that your
project goes to the right TA, and that will take some time as we sort
out the class!).
Return to 6.001 Home Page
Last modified: Tue Feb 3 18:55:45 EST 2004