Course web page: Introduction to Computer Science for non-majors II James Tam | Return to the course web page |
Additional details will be added over time...
I won't be able to provide a breakdown by topic because there will likely be a number of overlap in the topics that need to be applied for a particular question (e.g., displaying a linked list require knowledge of list operations but could also require recursion). However I can provide you with a general idea of which topics will likely result in a higher proportion of the final exam (the 'major' exam topics shown below)
'Major' exam topics: higher probability you will see a higher weight short answer question from one the topics on this list |
Advanced Java (it was a part of the last midterm but there are many useful concepts that have showed up again and again). |
Hierarchies (especially inheritance) |
Graphical user interfaces |
Linked lists |
'Minor' exam topics: if included on the final exam it's more likely that the topics on this list will appear in the multiple choice section or perhaps a lower weight short answer question |
Material covered from the first lecture up to and excluding Advanced Java. |
Exceptions |
File input and output |
Recursion |
Design patterns |
Java history |
Multiple choice questions 16 marks |
|
16 questions | |
Short answer questions 50 marks |
|
Code writing questions: x 5 (~40 marks) | |
Code tracing questions: x 1 (10 marks) | |
Conceptual questions: x 1 (2 marks) |
1 It's based on a near-final version of the midterm (exact proportions may vary *slightly*)
Min percent | GPA |
0 | 0 |
10 | 0.3 |
35 | 0.7 |
38 | 1 |
40 | 1.1 |
42 | 1.2 |
44 | 1.3 |
46 | 1.4 |
48 | 1.5 |
50 | 1.6 |
52 | 1.7 |
54 | 1.8 |
56 | 1.9 |
58 | 2 |
59 | 2.1 |
61 | 2.2 |
63 | 2.3 |
65 | 2.4 |
67 | 2.5 |
69 | 2.6 |
71 | 2.7 |
72 | 2.8 |
73 | 2.9 |
74 | 3 |
76 | 3.1 |
78 | 3.2 |
80 | 3.3 |
81 | 3.4 |
82 | 3.5 |
83 | 3.6 |
85 | 3.7 |
86 | 3.8 |
88 | 3.9 |
90 | 4 |
92 | 4.1 |
94 | 4.2 |
96 | 4.3 |