UC Berkeley – Computer Science
CS61B: Data Structures
Practice Midterm #2, Spring 2016
Constructed by Sherdil Niyaz
(Please email me with any typos or other mistakes that you find)
This practice test has ? questions worth a total of ?? points. This exam has been written by a TA who has
not yet looked at the official Midterm 2. This is an unofficial practice test to give you practice for the
actual midterm. There’s a very high chance your midterm will look nothing like this. This is only a tool
to give you practice and tell you what you need to study.
“I pledge to solve all problems on this practice exam without looking at the solutions, and to never be
discouraged while studying!”
Signature: ________________________
Tips:
•There may be partial credit for incomplete answers on the actual exam. Write as much of the
solution as you can, but bear in mind that we may deduct points if your answers are much more
complicated than necessary.
•There are a lot of problems on this exam. Work through the ones with which you are comfortable
first. Do not get overly captivated by interesting design issues or complex corner cases you’re
not sure about.
•Not all information provided in a problem may be useful.
•Unless otherwise stated, all given code on this exam should compile. All code has been compiled
and executed before printing, but in the unlikely event that we do happen to catch any bugs in the
exam, we’ll announce a fix. Unless we specifically give you the option, the correct answer is not
‘does not compile.’
•Ask Professor Hug to give you a hug at the end of the semester.
Optional. Mark along the line to show your feelings Before exam: [☹____________________☺].
on the spectrum between ☹ and ☺. After exam: [☹____________________☺].
