e02 : Final Exam
| num | ready? | description | exam date |
|---|---|---|---|
| e02 | true | Final Exam | Thu 12/08 12:00PM |
Time and location
- The final exam will be on Dec 8, noon - 3p.
- Location will be the regular lecture hall or one of the overflow rooms (Phelps 3525 or Phelps 3526)
- Room and seating number will be assigned.
- Note: Students taking the final in the main lecture hall or overflow room (Phelps 3526) are required to bring a fully charged laptop that is expected to last for 2 hours
- All students must complete this survey by Fri Dec 2 at noon to get their assigned seat: https://forms.gle/wHupQCCPZ4UVxoWu8. If you don’t complete the survey by this time, there are no guarantees that you will receive your preferred seat type or a computer/laptop to complete the exam.
Format of the final exam
- The final exam will be held in person
- The exam has 2 parts, both are closed book and closed notes.
-Part 1 of the exam will be an auto-graded coding assignment that you are expected to complete and test your code on a computer, and submit to Gradescope. You have approximately 1 hour 45 minutes to complete this part.
- Part 1 of the exam will be paper and pencil and will mostly test on concepts. You have approximately 1 hour 15 minutes to complete part 1.
- You MAY NOT collaborate with each other. If the instructor finds evidence of cheating, she will report you to the office of academic integrity and you can expect to receive an F in the course. Students who offer help on the exam will be held equally responsible as those soliciting help.
Exam topics
You are expected to know all the material covered in class. Most of the emphasis will be on topics covered in post midterm 1 - such as dynamic memory allocation, heap vs stack, linked-lists, iteration through lists, pointer arithmetic, strings and recursion on linked-lists and strings
You must know all material covered in lecture, the homeworks, and the labs. Special emphasis will be placed in labs 6–8.
Here are some important topics that you should definitely expect questions on:
- Flow control if-else statements
- Data types and declarations
- While loops
- For loops
- Evaluating expressions
- Data representation
- Arrays and vectors
- Passing parameters to functions (by value, reference, address)
- Passing arrays to functions and returning arrays from functions
- Pointers
- Structs
- Pointers and structs
- Pointers and arrays
- Arrays of structs
- Dynamic Memory Allocation
- Linked-lists
- Strings
- Iteration through lists
- Recursion
Exam resources
- Pracice problem: Please go through the problems in our Concept Inventory for additional preparation.
- Consolidated exam notes
Past exams
-
Past exams: You may also refer to all the past exams. Please note that some questions on these exams may refer to labs that you have not completed so far. You will only be asked questions related to the labs you have completed. The past exams should however provide some information on the expected difficulty and approximate format of the exam. Please note that there may be differences in content as well.
- Spring’18 - midterm 1
- Spring’18 Midterm 1 solutions
- Spring’17 - midterm 2
- Spring’17 Midterm 2 solutions
- Spring’17 - midterm 1
- Spring’17 Midterm 1 solutions
- Winter’17 - midterm 1
- Winter’17 Midterm 1 solutions
- Winter’17 - midterm 2
- Winter’17 Midterm 2 solutions
- Winter’17-Final
- Spring’17-Final
- Winter’18-Final