e02 : Final Exam
num | ready? | description | exam date |
---|---|---|---|
e02 | true | Final Exam | Tue 03/15 12:00PM |
Instructions for the exam
-
The exam will be in person on Tuesday March 15, noon - 3p at the lecture hall location (BUCHN 1910). Students who have DSP accommodations will take the exam at a different location, please make sure you submit a request via the DSP portal: https://dsp.sa.ucsb.edu/services
-
The exam will be closed book, no laptops or electronic devices are allowed. However, you may bring a one-page A4 or letter size paper containing your notes (front and back). Notes may be handwritten or typed.
-
If you find any information on the exam unclear, make assumptions as you see appropriate, state those assumptions clearly, and answer the question. You may not ask questions of each other or the course staff during the exam.
-
Seating chart posted on Piazza: https://piazza.com/class/kxtgemarj5ho?cid=649
-
Please bring your ID card to the exam.
-
Please write with a dark pencil or pen.
Exam topics
Review all topics covered in weeks 1- 10. Emphasis will be placed on the data structures and concepts covered after linked lists:
- 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 data structures
- Selecting an appropriate data structure to solve a problem
- templates and iterators
- The C++ STL container classes: vector, array, list, forward_list, deque, set, stack, queue, priority_queue (you must have working knowledge of these data structures and know the functions offered by them to perform the operations that they support)
All the homeworks, labs, pas, and code written in lecture
Past exams
Practice exams are available on gauchospace in addition to sample past exams provided below: