Introduction to Computer Science I for non-majors by James Tam Return to the course web page

CPSC 217: Final exam information

JT's note: more information will be provided as we get closer to the exam date.

Date/location:

Review material:

Front cover from the actual exam (so make sure you look at this beforehand...important!...note difference in the multiple choice section):

 

Exam topics

The final will be cumulative but with an emphasis on topics covered subsequent to the midterm which includes: functions, composites (especially string and lists), files/exceptions, history from the 1970's to the history of the Internet (that amounts to Slides #24 -  64) and the introduction to computer science. The last two topics in this list will be of a slightly smaller weight than the other topics covered after the midterm (they are less likely to be the focus of a high weight written question). Finally there could be a small number of questions about creating graphical output in Python using the 'tkinter' library (see the [example program] that I gave TA's to cover in tutorial as example). The material related to other example I gave the TA's which shows how to write a graphical interface (button) won't be included on the final exam.

 

Exam questions1

Multiple choice questions 18 marks

  18 multiple choice questions

Short answer questions  28 marks

  Code writing questions x 2: 15 marks
  Code tracing questions x 3: 11 marks
  Conceptual question (e.g., define a term, describe a concept2): 2 marks

1 Based on a near-final version of the midterm (exact proportions may vary *slightly*)

2 Example: why is it that when a reference to a list into a function that sometimes the list can be changed in the function while other times the list remains unchanged (even though the assignment operator has been used in conjunction with the reference - see the TopHat questions for an example program).