MT2 Info

Spring 2024 Canary: The following information has been updated for Spring 2024, with more updates to come!

Overview and Process

The exam will be IN PERSON!

• Time/Date: Thursday April 4th at 7 PM Pacific
  • The test will be set for 1 hour, 40 minutes
  • If you have USC approved accommodations, you must upload your accomodation information HERE by 11am on Thursday February 15th, otherwise you will not be able to use your accomodations.
• Location: depends on your lecture section and the letter your last name starts with
  • 11 AM section:
    • SLH 102 Last Name Starts with A - G
    • SLH 200 Last Name Starts with H - Z
  • 8 AM section:
    • SLH 100 Last Name Starts with A - K
    • SGM 101 Last Name Starts with L - Z
  • If you have OSAS accomodations you should schedule your exam at the OSAS offices on Thursday or Friday during OSAS hours
• The test will be taken on Gradescope and on paper. Be prepared with your laptop, and 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.
• You are allowed 1 8.5x11 handwritten (front and back) cheatsheet. No printed cheat sheets. No single-sided, taped pages to form a double-sided sheet. You will be asked to turn your cheatsheet in when you are done with the exam (so if you want it for posterity, make a copy beforehand).

Topics and Style

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

Unit 9 - Priority Queues and Heaps

• Build Heap
• Heap Sort

Unit 10 - Graph Representations and Traversals

• Graph Algorithms

Unit 11 - Recursive Graph & Tree Traversals Algorithms

• Graph Traversals

Unit 12 - Recursion: Combinations & Backtracking

• Recursion
• Combinations & Backtracking

Unit 13 - Iterators

• Iterators

Unit 14 - Binary Search Trees & AVL Trees

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

Unit 15 - Splay Trees

• Splay Trees

Unit 16 - Hash Tables Intro

• Introductory hash-table

Practice Materials

Sample Midterms

• Sample Midterm Heap Problems - Solutions
• Sample Midterm - Solutions
  • Copy construction, operator overloading are not a major focus of CS104 but were in previous years.
• Sample Midterm 2 (partial solutions)
  • Q1 Solution
  • Q2 and Q3 Solution
• Summer 2020 Midterm (Programming) (no solutions)
• Summer 2021 Midterm (Hybrid)
  • Skeleton Code
  • Solutions

Practice Quizzes

• ADTs - Solutions
• Streams and Simple Recursion - Solutions
• Runtime and Recursion - [No Solutions]
• Linked Lists and Recursion - Solutions
• Build-heap - Solutions