We will have two in-person exams, joint with both lectures.
More details including sample exams and topics will be shared later.
Bring a photo ID with you to the exam.
1. Closed book, closed notes.
2. No calculators, cell phones, or other electronic devices allowed.
3. Writing after time has been called will result in a loss of points on your exam.
4. You will be provided this reference sheet during the exam.
The final is cumulative, which means we can ask you about any topic from the whole class. That said, we will put significantly more focus on the second-half of the course. I will not ask you to actually *do* an AVL insertion, but having a reasonable idea of how these work would be a good idea. This is roughly: Hashing, Sorting, Graphs, Parallelism, Concurrency. This quarter P/NP is covered on EX12 and thus will NOT be a topic for our final exam. You should ignore questions on P/NP found on previous as exams.
We provide some exams from previous quarters of 332 to help with your studying. Be aware that the topics covered may vary from what will be covered on our exam - refer to the list above if you are wondering about a particular topic. Our hope is that these exams will be useful in your studying, but you should NOT take them as a guarantee of exactly what your exam will be like this quarter. They are provided only to help you in your studying. We recommend taking these exams on your own in a timed environment to get practice both with the material and with managing your time. Most students find this approach better preparation than just looking at the solutions.
Bring a photo ID with you to the exam.
You must take the exam in the room you are assigned to.
Assignment is by your Last Name: BAG 154 (Last Name A-H) & BAG 131 (Last Name I-Z)
1. Closed book, closed notes.
2. No calculators, cell phones, or other electronic devices allowed.
3. Writing after time has been called will result in a loss of points on your exam.
4. You will be provided this reference sheet during the exam.
All material from the course from lecture 1 up to and including AVL trees is fair game.
Hashing and sorting will NOT be on the midterm. Check the lecture calendar for links to all slides and ink used in class, as well as readings for each topic.
1. Note that you may be required to write pseudocode, but it will be evaluated as an algorithm, not as valid Java (or whatever) code.
2. Writing a simple proof of some sort is a possibility. Any such proof will be intended to show that you know how to prove things. You will not be expected to have a "magic insight" in order to complete the proof.
3. The homeworks and section problems thus far are a decent indication of the types of questions that could be asked.
We provide some exams from previous quarters of 332 to help with your studying. Be aware that the topics covered may vary from what will be covered on our exam - refer to the list above if you are wondering about a particular topic. In partiuclar, we have not covered B-trees this quarter. Our hope is that these exams will be useful in your studying, but you should *NOT* take them as a guarantee of exactly what your exam will be like this quarter. They are provided only to help you in your studying. We recommend *taking* these exams on your own in a timed environment to get practice both with the material and with managing your time. Most students find this approach better preparation than just looking at the solutions.