Computer Science 126
Readings, Exercises, and Exams
For the entire CS126 crew, I would like to say that the students of this class are great! You guys have accomplished an enormous amount under lots of pressure in a remarkably short period of time. You're both smart and diligent and it's been a pleasure to teach a class of this caliber. Over and out :)
The database for the
is updated to include
scores. Various grade
) are also available. Grade calculation is based on 35% programming assignments, 15% on each of the two midterms, 30% final, and 5% precept participation.
The final and its solutions are now
. The scores are not yet in but will be in the ScoreBot shortly. (A note: for questions whose later parts depend on earlier parts, when appropriate, we make a conscious effort of not penalizing people for the same mistake multiple times.)
Several errors have been found in the extra exercises and answers. Here are updated versions of the
The policy on a 1-page 'cheat sheet' for the final is the same as it was for the midterm exams.
'cheat sheet' is allowed. You will be given TOY instructions and other information, as necessary, to answer the questions.
Extra final review
have been created to help you study for the final. You should also review the architecture
) & the
extra language exercises
Preceptors will be available in their offices at the following
Precepts will meet at their normal times/places tomorrow. Precepts will not meet on the following monday (as previously indicated on the syllabus.)
There will be evening review sessions before the final on Wednesday Jan. 19 and Thursday Jan. 20 from 8-10 pm in rooms CS301/CS302.
Reminder: there is no precept tomorrow. The first lecture after the break is 1/4. The last programming assigment is due on 1/5. The final exam is on 1/21 at 1:30.
the compiler code
used in today's lecture is on-line.
Some people asked about
the example codes used in the Java lectures
so they are on-line now.
The database for the
is updated to include the second midterm score. The
of the exam is also available. The histogram only reflects the exam score; the ScoreBot gives the overall ranking.
The second midterm and its solutions are now
. The scores are not yet in but will be in the ScoreBot shortly.
Reminder: there is
lecture on Tuesday 11/23.
The database for the
is updated. It should contain all the scores up to the 5th programming assignment.
The additional architecture
are now available.
Makeups for the second midterm will be given at 4pm Sunday (11/21) and 7pm Tuesday (11/23). Come to my office (320 Computer Science Building) at those times. (I'll try to arrange to resolve the building lock issue.) The list of logins of people who have signed up are: Sunday, shnayder, aneimark, kburke, jofoley; and Tuesday, aneel, nchang, clin, danbrian, wei. If your name is not in the list and you want to take the makeup, see me after lecture on Thursday.
The second midterm is scheduled for Monday 11/22. Same drill as the first one. It will be at 7pm in MC46. It covers the lectures up to and including T2: Abstract Machines. It's close book. No cheat sheet. No calculators.
You can now get your
automatically in the email from the
You can disregard the lecture notes for the last lecture of computer architecture in your course reader. Instead, refer to
Graded makeup exams will be returned after class tomorrow.
The notes in your course reader on "memory" implementation of the sequential circuit lecture contain many mistakes. Refer to
You can now
which web pages at the course web site have changed recently.
The alternate instructions for programming assignment 4 are now
of the first midterm is now available. Of course, the boundary cases of grade assignment shown in the graph are meant to be vague and flexible.
The first midterm and its solutions are now
, marking the end of the last makeup exam.
A cheat sheet is
allowed for this midterm exam.
Page A2-3 of the
TOY programming lecture notes
(both the online version and the one in the course packet) is wrong. Change 2^16 to 2^15.
There is a mistake on reading list for the 'linked list exercises' in the course packet. The correct sections should be: K & R, 6.5 and Sedgewick, 3.3, 3.4.
The java TOY demo on the
page (and to be shown in lecture on 10/14) is available for
. This stuff should work on both Windows PCs and Unix machines. What can you do with it after you have saved the "toy.zip" file on your computer? Follow these steps: 1) Make a new folder (or directory). 2) Extract the files from "toy.zip" and put it in this directory. 3) Remember where these files are. 4) Open the toy.html file from this directory using netscape. The java demo should be running in your browser. 5) To modify or add TOY machine language programs, edit the obvious parts in the "toy.html" file; then reopen the file "toy.html" in your browser.
The first midterm is scheduled for Wednesday 10/20. It will be at 7pm in MC46. It covers the lectures up to and including Binary Search Tree. (The first couple hardware lectures will
be on the first midterm.) It's close book. The best way to prepare for it is to keep up with the readings and exercises.
I was asked to clarify the difference between "RAT.c" and "RATbetter.c" for assignment 3. "RATbetter.c" does 1) simplification using gcd, and 2) addressing overflow using also gcd. "RAT.c" does neither.
It's been brought to my attention that ghostview on the "arizona" cluster fails to display the annotated lecture notes. I see that the software is out of date and am asking CIT to fix it. Meanwhile, I have put out alternative "pdf" versions. If you don't already have a pdf viewer, you can download one from
the Adobe download page
Some have asked about the availability of the additional lecture slides that are not in the course packet. They are being made available on the
lectures notes page
as soon as I can make them. If you don't already have a postscript viewer, you can download one from the
ghostview home page
number representation exercises
" in the course packet have wrong answers to questions 2, 3, and 4. The
is now corrected. Again, our apologies.
If you have opinions that you like to voice about the class, you can now send
to the CS126 crew.
The output for part 3 of the first programming assignment was changed to reflect the correct results based on the changed stock15.txt file. To avoid further confusion, the
for all parts of the stock market programming assignment has been posted.
Another typo in the first programming asignment. Dilbert should 'sell' when the stock goes down in period 8.
For those who had to miss the precept on Monday, Lisa will hold a makeup precept on Wednesday night (9/22) at 7pm in CS102 or CS103.
There is a typo in
. The first price should be 26.375,
The course packet is now available at Pequod (6 Nassau St., 951-0300).
Undergraduate lab TA
. of CS101 is now available.
If you want to change your precept schedule, please talk to Lisa (lworthin@cs), not Tina McCoy.
Assignment 0 is due Wednesday 9/22 11:59pm. Reading this page is an important part of Assignment 0. To demonstrate that you've completed the assignment, while also providing us with helpful statistical information, you must fill out the
COS 126 student survey
The course packet and assignments have been revised, so you should get a new course packet at Pequod copy. They will be available the first week of class.
You are visitor
since August 16, 1999.