The comments/solutions for Exam 1 are here: [PDF]
Please read them and come to my office hours with questions about any of the problems you don’t understand. If you can provide a solution that significantly improves any of our provided solutions, you can also receive bonus points for that.
I made a mistake for the last example for Question 11 on the Exam. It should be:
(count-tandem-repeats (list 1 2 3 1 2 1 2 3) 3) should evaluate to 1
The first instance does count (as is clear from the other examples), so the result of count-tandem-repeats should always be at least 1.
Exam 1 was handed out in class today. It is also available here: [PDF]. If you print it yourself, please print it using one sided printing.
The exam is due at the beginning of class Wednesday.
For question 9, you will get full credit even if your answer assumes that a and b must be the same length. An answer that works when the input lengths are not necessarily equal, is worth bonus points.
The Assistant Coaches will hold review sessions for Exam 1:
The review sessions will be held in Rice 442. (They intend to cover similar material in both sessions, although this will depend on the questions you have. You are free to attend both sessions if you want, but should expect to see some duplicate material if you go to both of them.)
I will hold my normal office hours next week (Monday, 1:15-2pm; Tuesday, 11am-noon; Thursday, 9:45am-11). The assistant coaches’ office hours on Monday, Tuesday, and Wednesday are canceled in place of the review session. There will be AC office hours on Thursday (1-2:30pm, Joseph; 4:30-6pm, Jonathan; 6-7:30pm, Jiamin). From Friday, October 7 (when the exam is handed out) until Wednesday, October 12 (when the exam is due) there will be no scheduled office hours.
I would recommend trying the practice exams from previous years to prepare for the exam. The exam from Fall 2009 is here:
http://www.cs.virginia.edu/evans/cs1120-f09/exams/exam1/exam1-twosided.pdf. I recommend trying to solve the problems yourself. The material we have covered this year is a bit different, so do not worry about the questions about running time analysis (Questions 5-7, Question 9, and Question 11). Other than those questions, you should be able to solve all the problems on this exam. (Note that the main thing we have covered that was not covered on this exam is machines. You shouldn’t be surprised if your exam has a few questions about computing with machines including understanding Turing Machines, even though there are no questions about this on the practice exam.) There are solutions available for this exam, but I strongly recommend trying the problems seriously yourself before looking at the solutions.
If you want more practice exams, you can find previous exams from other semesters here: http://www.cs.virginia.edu/~evans/cs1120-f09/exams/.
Recent Comments