CPSC 231: Final exam information

General information:

Exam weight: 35% of overall course grade
Duration: 120 Minutes
Date/location: This exam is scheduled by the Office of the Registrar so you can find this information on the university portal
This is a closed book exam: No electronic devices (e.g., cell phones) or computational aids (e.g., calculators, laptops, hand computers, slide rules, abaci) will be allowed).

Instructions:

Unless otherwise stated assume that all programs and program fragments will compile.
When you are done hand in your multiple choice bubble sheet and this answer booklet at the front.

Instructions for the multiple choice questions:

Pick the best answer for each question.
Mark your answers and contact information with an HB pencil or darker.
Make sure that you fill in all the labelled categories regarding your contact information on the computerized bubble sheet.

· Make sure you fill in all your answers in the computerized bubble sheets and not in this exam.

Instructions for the short answer written questions:

Make sure that you fill in your answers in the space provided in this booklet.
Write your name on the first page of this exam.
Write your name and ID number on the second page of this exam.

Exam review

During the end of the last lecture I will conduct a brief exam review.

Breakdown of the type of questions

Written questions				Approximate percentage of the exam
	Writing programs x 3			46%
	Tracing programs x 2			26%
	Conceptual questions x 2			17%
Multiple choice
	10 questions			11%

Exam format

Most or all of the exam will consist of written questions (there may be a few multiple choice questions).
The exam will be cumulative will a heavy emphasis on the material subsequent to the midterm (except for modular design/problem decomposition).
Topics which are likely candidates for the larger written questions (worth more marks).
	Modular design/problem decomposition
	Homogeneous types (in Pascal it's implemented as an array)
	Storage (in this course it was done using files)
	Heterogeneous composite types (in Pascal it's implemented as a record)
	Pointers
	Dynamic linked lists
Topics which may be covered in the multiple questions or smaller (lower worth) written questions.
	Material covered before the midterm
	Recursion
Topics which you won't be examined on.
	Sorting
	The history of computers
Types of written questions that you may see on the exam
	Writing programs: typically such a question will have a partially implemented solution or problem description and you will be required to write a single function or procedure. Or you may have to write a small but complete program.
	Tracing programs: given a program or fragment of a program you could be asked to indicate what the output of the program will be.
	Conceptual questions: could involve describing a concept or defining a term. It could be combined with one of the above types of questions too e.g., what is a bus error, why might the program below cause such an error to occur or write the code that may result in a bus error.