Exam 1 Info

When

Oct 5, 2018

Topics

• asymptotics
• worst-case asymptotic analysis of
  • recursive algorithms
  • algorithms containing loops
• naive algorithm for SUBSET SUM
• naive algorithm for TSP
• inversions in arrays
• heaps & priority queues
• binary trees
• binary search trees
• splay trees
• sorting algorithms
  • insertion sort
  • heap sort
  • tree sort

Exam Format

• Closed book, closed notes, no electronic devices
• Can bring in a US-letter sized paper with your notes hand-written on it. (You may use both sides.)
• No computer-generated printout allowed