e02 : Final Exam
| num | ready? | description | exam date |
|---|---|---|---|
| e02 | true | Final Exam | Thu 09/12 02:00PM |
Seating arrangement
The exam will be in the same room as lectures: CHEM 1171 Please sit in the exam hall according to this seating chart [TBD]
If you would like to request a left handed or right handed seat, please contact the instructor.
Instructions for the exam
- You may bring one 8.5” x 11” piece of paper with notes on both sides. This paper will be collected along with your exam, so make your own copy if you would like to keep it.
- No calculators or phones are allowed in the exam
- No other notes or books are allowed
- There are no makeups for this exam
- You must write your name on every single sheet of paper including your notes
- We will provide you with scratch paper
Exam topics
Emphasis will be placed on the following topics
- Binary Search Trees
- Stacks
- Queues
- Heaps (priority queues)
- Recursive implementations on BSTs
- Running time (big O) of all data structures covered so far
- Big-O analysis of code that involves any of the data structures covered so far
- Selecting an appropriate data structure to solve a problem
- basics of templates and generic programming
- The C++ STL container classes: set, priority_queue, stack, queue
All the homeworks , labs and pas
Past exams
- S19 Midterm 1
- S19 Midterm 2
- W18 Final exam
- W18 Midterm exam
- SP 17 Final exam
- SP 17 Final exam solutions, Note Q10 involves iterators and will not be on the exam.