EECS 281 Midterm

Relevant Class: EECS 281

Topics Covered

• Stack, Queue, Deque, Priority Queue ADTs
• Complexity Analysis (Substitution Method (Time Complexity), Big-O Notation)
• Recursion (and The Master Theorem)
• Container Data Structures (Array, Vector, Linked List)
  • Iterators
• Heaps and Heapsort
• Ordered Arrays and Related Algorithms
• Sorting
  • Elementary Sorts (Insertion Sort, Bubble Sort, Selection Sort)
    • Sort Adaptations / Improvements
  • Quicksort
  • Mergesort