MT2 Info
Spring 2026 Canary: This page was updated on 11/13 for Fall 2026
Overview and Process
- Time/Date: Thursday, November 19th Pacific - 70 minutes (during class).
- Location: (Based on Normal class meeting time!)
- 9:30am: SAL 101
- OSAS Accommodations: If you have USC approved accommodations, you will need to coordinate in advance with the OSAS office to schedule your exam at the testing center.
- Bring: A pencil and good eraser or a pen if you feel brave.
- Format: The exam is fill-in-the-blank short answer and coding questions pertaining to project 1.
- Questions: Raise your hand, but PLEASE try not ask excessive questions (and if you know that you tend to ask questions, sit on the aisle or up front.)
- Policies:
- The exam is Closed book, Closed Internet (search/reference). No outside resources. No calculators, phones, or textbooks are allowed.
- You must request to leave the classroom for any reason and must hand your exam to an instructor for safekeeping untill you return. You must also leave all electronic devices in the classroom.
- You may NOT have headphones or earbuds in.
- All writing must cease by the exam end time and anything after that will be consider a violation and WILL result in penalties!
Topics
The following is the list of topics that you should be familiar with. Use it as a guide to help your studying.
Unit 3
- Basic objects (structs)
- Assignment of objects
.and->operators- Using C++
stringclass - Defining your own classes
- public vs. private
- Constructors and Destructors and when they execute
- Defining member functions
- Splitting your class into files
Unit 4
- Linked Lists
- Implementing basic operations (push, pop to front, middle, or back)
- Efficiency of various operations given variations of their implementation (with or without tail pointer, etc)
- Pros and cons compared to arrays
- Doubly Linked lists and operations
vector<T>basic operation- Efficiency of their operations
- Deque implementations (which can work vs. cannot work)
- Efficiency of various operations given variations of their implementation (with or without tail pointer, etc)
deque<T>class- Use of
getline() - Checking an input stream for failure
- Checking for failure when opening a file
- Using C++
ifstreamandofstreamclasses for File I/O - Images
- Multidimensional arrays and images
Maze PA (this list is not exhaustive)
- Queues and thier implementation, either with an array or linked list
- Reading in and storing a maze
- Using structs in other data structures
- BFS and the implementation of BFS
- 2D array vs. 2D vector allocation
- Backtracking and displaying a solved maze

