MT2 Info

Spring 2026 Canary: The following information HAS NOW been updated for Spring 2026!

Overview and Process

The test will be IN PERSON

• Time/Date: 7pm-8:40pm Apr 2nd
  • The test will be set for 1 hour, 40 minutes
  • If you have USC approved accommodations, you must upload your accomodation information HERE 7 days before the exam, otherwise you will not be able to use your accommodations.

• Location: THH 101 & 102

  • If you have OSAS accommodations you should schedule your exam at the OSAS offices on Thursday during OSAS hours
• The test will be taken on paper. Be prepared a pencil/pen.
• The exam is Closed book, Closed notes, Closed Internet (search/reference). You may use your mind, and blank scratch paper but nothing else. No referencing your labs, homeworks, etc.

Topics and Style

The exam is a mix of short answer, multiple choice, analysis, tracing, and coding. We will visually grade your code and be fairly lenient with small syntax errors (e.g. a missing semicolon).

Unit 7 - Queues and Stack

• Implementation options and their efficiency
• ArrayBased list implementations (resizing and its runtime)
• Queue, stack and deque implementations
• Applications of queues and stacks

Unit 8 - Templates

• Process for defining templated classes
• Basic rules for templates and inheritance
• Functors

Unit 9 - PQ and Heaps

• Tree representations and storage
• Full, complete, and balanced tree definitions
• Implementation of a priority queue
• Heap implementation and operations (push, pop, top) and runtime
• build-heap (make-heap) algorithm and runtime
• heap-sort

Unit 10 - Graph Representations and Traversals

• Graph Algorithms

Unit 11 - Recursive Graph & Tree Traversals Algorithms

• Graph Traversals

Unit 12 - Binary Search Trees & AVL Trees

• Binary Search Trees
• Balanced Binary Search Trees / AVL Trees

Unit 13 - Splay Trees

• Splay Trees

Unit 14 - Iterators

• Iterators

Study Guide

• Make sure you what you did in your homework well!

Practice Materials

Heaps

• Heap Trainer Website
  • Practice push, pop, and make-heap including from JUST the array-view.
• make-heap Algorithm 1
  • Problem ; Solution
• make-heap Algorithm 2
  • Problem ; Solution
• make-heap Algorithm 3
  • Problem ; Solution
• Reasoning about heaps
  • Problem ; Solution
• Spring 2024 Review problem (Low priority)
  • Sample Midterm Heap Problems - Solutions

Dijkstra’s and A*

• A* practice 1
  • Problem ; Solution
• A* practice 2
  • Problem ; Solution

Graphs

• Graph / STL Coding
  • Problem ; Solution

Traversal Coding Problems

• Remove Depth
  • Problem ; Skeleton ; Solution
• Even Tree
  • Problem ; Solution
• Sum Large to Small
  • Problem ; Solution

AVL Tree Operations

• AVL Trainer Website

• Exercise set 1:
  • Problem ; Solution
• Exercise set 2:
  • Problem ; Solution

Other Coding Problems

• Pointer-based Heap Remove-Min
  • Problem ; Solution
• Heap/BST Coding
  • Problem ; Solution

Recurrence Relationship (May not be tested…See topic list)

• Lazy-Quicksort ; Solutions