Old Exam Questions
You can view old exam questions here. The questions are password protected. Please email us to get the login credentials.Exam Structure
For choosing what types of questions to include and what point values to assign them, here are example structures used in our CSE 142 and 143 classes.142 Midterm
| Question | Description | Points |
|---|---|---|
| 1 | Expressions | 10 |
| 2 | Parameter Mystery | 12 |
| 3 | If/Else Simulation | 12 |
| 4 | While Loop Simulation | 12 |
| 5 | Assertions | 15 |
| 6 | Programming | 15 |
| 7 | Programming | 15 |
| 8 | Programming (Hard) | 9 |
| total | 100 |
142 Final
| Question | Description | Points |
|---|---|---|
| 1 | Reference Mystery | 5 |
| 2 | Array Simulation | 10 |
| 3 | Inheritance | 6 |
| 4 | Token-Based File Processing | 10 |
| 5 | Line-Based File Processing | 9 |
| 6 | Arrays | 10 |
| 7 | ArrayList | 10 |
| 8 | Critters | 15 |
| 9 | Arrays | 15 |
| 10 | Programming (Hard) | 10 |
| total | 100 |
143 Midterm
| Question | Description | Points |
|---|---|---|
| 1 | Recursive Tracing | 15 |
| 2 | Recursive Programming | 15 |
| 3 | Details of Inheritance | 20 |
| 4 | Linked Lists | 15 |
| 5 | Array Programming | 10 |
| 6 | Stacks/Queues | 25 |
| Total | 100 |
143 Final
| Question | Description | Points |
|---|---|---|
| 1 | Binary Tree Traversal | 6 |
| 2 | Binary Search Tree | 4 |
| 3 | Collections Mystery | 5 |
| 4 | Collections Programming | 5 |
| 5 | Binary Trees | 10 |
| 6 | Collections Programming | 10 |
| 7 | Comparable class | 20 |
| 8 | Binary Trees | 20 |
| 9 | Linked Lists | 20 |
| Total | 100 |