CS103 Midterm Exam
October 27, 2009
I acknowledge and accept the Stanford University Honor Code:
Signature: _______________________________________________
NAME (print): ____________________________________________
1)
You
have 2.0 hours to complete this exam.
2)
Do not include your scratch work with your exam
.
Please work the solutions out
on another sheet of paper and then write your solutions neatly on the exam.
3)
Be certain that you submit only one answer to each question
.
If you happen to
write out more than one solution to a question, indicate clearly which one we
should grade; otherwise, we will make an arbitrary choice.
4)
This is an open-note exam, and the Rosen chapter and Sipser text.
You may also
use a one page cheat-sheet (both sides OK) of your own design.
You will find
useful rules from Rosen at the back of the exam.
5)
Please write clearly and neatly. Using a pencil works best.
In your proofs for this exam, you may cite any theorems or equivalences that are
proved
in Rosen or the handouts, or that were proved in class.
Items that were
mentioned without proof may not be used unless you prove them.
For example, 6
equivalent statements concerning graphs were shown in class, but other than one
that was on a problem set, these equivalences were not proved.
Thus they may not
be used unless you prove them here.
Score
Grader
1) (20 points)
___________
________
2) (20 points)
___________
________
3) (20 points)
___________
________
4) (20 points)
___________
________
5) (20 points)
___________
________
Total:
___________
NOTE: White space has been removed from the practice exam to save paper.

This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*