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

CPSC 217: Final Exam Information

Nov 15: You should check back at this link periodically as updates, additional information may be added.

Date/location:

Review material:

Instructions for the day of the exam (instructions that you should read and become familiar with before you start writing)

Instructions for the written questions:

To be awarded credit for your exam you need to hand in both your multiple-choice answer sheet and the question booklet with the Scantron sheet inside of the booklet.

Material that you should study

Exam topics

The exam will be cumulative. You are expected to be familiar with material covered before the midterm. But the bulk of the questions will focus heavily on material you saw after the midterm. The exception is functions. Because it's difficult to write useful or even just semi-useful program by applying just one programming concept some exam questions will relate to material from several topics (e.g., you could be required to apply branches, functions, files and lists in just a single question or even in the body of a single function). Consequently it won't be possible to give a topic by topic break-down of the proportion of the exam that relate to a particular topic. However what can be specified is the major topics (worth a greater proportion of the final exam) and the minor topics (still important but will tend to be worth a lesser proportion).

Major topics

 

Minor topics

 

CPSC 217: optional extra topics not covered on the final exam (required topics for CPSC 231)

  • Functions
 
  • Material covered before the midterm (save for functions)
 
  • Object-Oriented programming
  • Lists
 
  • Other composites: tuples, strings
 
  • Recursion
   
  • Files and exceptions
   
 
  • Computer history: there will be a pre-recorded video linked into D2L which expand on the outline points in the course notes.
   
   
  • Introduction to computer science: there will be a pre-recorded video linked into D2L which expand on the outline points in the course notes.
   
   
  • Admin topics and introduction to the course (covered start of term)
   
   
  • Exam instructions - again I could ask you exam questions about the exam instructions. That means you must read the exam instructions in order to get credit (although you should be reading instructions even without be examined on the instructions.
   

Exam questions1

Multiple choice questions (as indicated in the admin. lectures this will be a smaller proportion of the exam vs. the midterm)

  35 - 45 questions

Short answer: 4 questions

  Code writing x 2 questions
  Code tracing x 1 question
  Writing (brief - bullet points are okay): conceptual (e.g. mutable vs. immutable), knowledge-based (e.g. How did IBM end up exiting the microcomputer market that it invented) x 2 question

1 It's based on a rough version of the final exam (exact proportions may vary somewhat

Again: You are expected to be familiar with common functions that have been covered in class such as but not limited to: print()input()int()float()str()randrange().

Min. percentage cut off to be awarded grade point
GPA
 
GPA
0.00 0
5.00 0.1
10.00 0.2
15.00 0.3
20.00 0.4
25.00 0.5
30.00 0.6
33.00 0.7
36.00 0.8
38.00 0.9
40.00 1
42.00 1.1
44.00 1.2
45.00 1.3
47.00 1.4
48.00 1.5
51.00 1.6
53.00 1.7
55.00 1.8
57.00 1.9
59.00 2
60.00 2.1
62.00 2.2
64.00 2.3
66.00 2.4
67.00 2.5
68.00 2.6
70.00 2.7
71.00 2.8
72.00 2.9
73.00 3
74.00 3.1
75.00 3.2
76.00 3.3
77.00 3.4
78.00 3.5
79.00 3.6
82.00 3.7
84.00 3.8
86.00 3.9
88.00 4
92.00 4.1
95.00 4.2
98.00 4.3