Course web page: Introduction to Computer Science for Majors I by James Tam |
Additional details will be provided as we get closer to the exam so you should check this page for updates.
Date/time: Wednesday April 27 2 PM
Location: ST061
Use a non-erasable pen to answer the written questions. Write your answer in the space provided.
Unless otherwise indicated you can assume that the programs and program fragments have no syntax errors and will translate.
The exam will be cumulative but focus on the material that was covered after the midterm (or covered before the midterm but you weren't tested on yet). This means that topics that you were tested on during the midterm may show up again during the final but will constitute a smaller portion of the exam (it may be a smaller weight written question or some questions in the multiple choice section). Alternatively the earlier material could indirectly show up as part of a question that focuses on the latter material (e.g., you could see branching and loops in questions whose main focus is classes and objects)
Topics (less of a focus on the final, mostly the earlier topics) | Topics after the midterm (heavier focus on the final) |
UNIX | Programming: functions |
Computers | Programming: composites |
Programming: Intro | Programming: classes and objects |
Programming: branches | Programming: file input and output |
Programming: loops | Programming: recursion |
Programming: producing graphics using QuickDraw | |
Introduction to Computer Science | |
Computer history |
Multiple choice questions: 20 questions |
20 marks |
|
Written questions |
35 marks |
|
Question 1: Code trace | 8 | |
Question 2: Code trace | 5 | |
Question 3: Code writing | 9 | |
Question 4: Code writing | 6 | |
Question 5: Code writing | 3 | |
Question 6: Conceptual | 4 |
1 Small changes may be made in the final version but this outline should at least give you a rough idea of the breakdowns and structure.