- Most of the exam will consist of
written questions (there will be a few multiple choice questions).
|
- The exam will be cumulative will a
heavy emphasis on the material subsequent to the midterm (except for
modular design/problem decomposition).
|
- Topics which are likely candidates for the larger (higher worth)
written questions.
|
| |
- Modular design/problem decomposition
|
| |
- Homogeneous types (in Pascal it's implemented as an array)
|
| |
- Storage (in this course it was done using files)
|
| |
- Heterogeneous composite types (in Pascal it's implemented as a record)
|
| |
- Pointers
|
| |
- Dynamic linked lists
|
- Topics which may be covered in the multiple questions or smaller
(lower worth) written questions.
|
| |
- Material covered before the midterm (excluding problem
decomposition/modular design)
|
| |
- Anything that was covered in class on computer history.
|
- Topics which you won't be examined on.
|
| |
- Sorting
|
| |
- Recursion
|
| |
- The introduction to Computer Science
|
- Types of written questions that you may see on the exam
|
| |
- Writing programs: typically such a question will have a partially
implemented solution and you will be required to write a single function
or procedure. Or you may have to write a small but complete program.
|
| |
- Tracing programs: given a program or fragment of a program
you could be asked to indicate what the output of the program will be.
|
| |
- Conceptual questions: could involve describing a concept or
defining a term. It could be combined with one of the above types of
questions too e.g., what is a bus error, why might the program below cause
such an error to occur or write the code that may result in a bus error.
|