csc148
Fall 1996	Info about the second midterm test	
==============================================================================

Notes: 
 - This information applies only to sections of 148 taught on the St George
   campus.
 - Individual instructors may have made additional remarks about the midterm
   in lecture.


Where and when -- just like last time
--------------

When: 	Wednesday November 13th
	Day classes -- at your tutorial time (10:00 or 1:00)
        Night class -- at 6:00 pm  <-- not your tutorial time!
       	The test will be 50 minutes long.

Where:	Day classes -- in your tutorial room
	Night class -- in the lecture hall

Day students must go to their OWN tutorial room (as assigned in the
course information sheet).  Otherwise, we could run out of copies of
the test!
		

Aids allowed -- just like last time
------------

No aids allowed; not even calculators.


Content
-------

We will emphasize material not covered on the first midterm, however some
questions may will build on, or return to, material from the beginning of term.

You are responsible for the following material:
 - Lectures and tutorials:
        everything covered; 
	up to and including recursion, but not proofs of correctness for
		recursive code
 - Assignments:
        we may ask about assignments, up to and including 3a
 - Readings:
        all readings assigned


How to study
------------

Major new topics since the last midterm include:
 - specifications, and proof of correctness for iterative code
	The assignments have not tested you on these topics, 
	so you should be sure to study them well.  Old exam questions
	are a good way to test your knowledge.
 - stacks and queues
	These are straightforward, and the concept of a queue is
	familiar from assignment 1.  Be sure to read through 
	the lecture notes on stacks and queues.
 - trees
	This ADT is less straightforward.  Make sure that you are 
	familiar with the terms we've defined, such as height of a tree,
	pre-order and post-order traversal, descendents of a node, etc.
	You should be able to write code involving trees.
	Assignment 3a gives excellent exam preparation on this topic.
 - recursion
	You should be able to trace and write simple recursive code.
	Assignment 3a gives excellent exam preparation on this topic.

Try to solve assignment 3a before the midterm.  This will be excellent
preparation on some of the topics, and will leave you 3 full weeks to
work on the real assignment 3.