Honors Basic Algorithms, Spring 2001: Midterm Page

• Here is the midterm exam in postscript, with solutions.
• Statistics for the midterm.

  RANGE	Number of Students
  less than 10	3
  11-20	4
  21-30	3
  31-40	6
  41-50	6
  51-60	4
  61-70	5
  71-80	5
  81-90	0
  91-100	0
  More than 100	2

  Average 46.6 Median 44

  ---

  INFORMATION BELOW IS FROM BEFORE THE MIDTERM

  ---

• The exam is on Monday March 5 (moved up from March 8). It is held in-class. This is a closed book exam, but you are allowed to refer to a ``cheat sheet'' which is a 8"x11" sheet of notes, written on both sides in whatever font size you want. This sheet can be re-used for the final exam, when you will be allowed two such sheets.

• Reading material from textbook: CLICK HERE

• Sample Midterms (with solutions) from the past: Fall00, Fall99 and Fall98. They roughly indicate the style of my questions. The actual subject matter varies from year to year.
• As you can see from the samples, these are the types of questions to expect:

  	(1) Short questions
  	(2) Multiple choice questions (including True/False).
  		In such questions, a WRONG answer may carry a negative 
  		score, while not answering the question gives you a zero 
  		score.
  	(3) Algorithmic Simulation.  These tests your working knowledge
  		of algorithms, as you mechanically carry out
  		the steps.  E.g. given a specific heap, show the 
  		intermediate transformations of the heap when you remove
  		the minimum item.
  	(4) Programming questions.  This, if it appears at all,
  		will be in support of other questions.
  	(5) Proofs.  You should know proofs by induction, by contradiction,
  		by case analysis.  
  	(6) Creative problems.  You need to use what you know and apply
  		it to solve some problems we pose.