| Introduction to Computer Science I for non-majors by James Tam | Return to the course web page |
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 post World War II to the history of the Internet ("History Part III" up to and including slide #31 and the material covered in lecture) 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.
Multiple choice questions 19 marks |
|
| 19 multiple choice question | |
Short answer questions 30 marks |
|
| Code writing questions x 2: 15 worth marks | |
| Code tracing questions x 3: worth 13 marks | |
| Conceptual question x 1: worth 2 marks | |
1 Based on a near-final version of the midterm (exact proportions may vary *slightly*)
2 Example conceptual question: 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).