CS 315: Study Guide for Midterm Exam

Date: Thursday, October 20, 2011, in class.

Reading:

Material covered in class:

• Big O:
  • Meaning of Big O; names of Big O classes (quadratic, etc.)
  • Given a function for time vs. n, reduce it to Big O.
  • Ranking of Big O: which is better
  • Big O for common algorithms
  • Estimate Big O for some given code
  • log(n) grows slowly
  • Estimate Big O from a log-log plot, from time ratios
• Linked List:
  • cons, first, rest, setfirst, setrest: be able to give the result of a call to these functions, and the ones below.
  • length, reverse, append, nconc, nreverse, member, assoc
  • intersection, union, set-difference
  • merge, sort
  • mapcar
  • some, every, subset
• Stack: using linked list, using array. Order in which items come out: LIFO.
  • push, pop
• Queue: using linked list, using array. Order in which items come out: FIFO.
• Java Collections:
  • LinkedList
  • ArrayList
  • Iteration over a Collection
• Trees:
  • Binary tree
  • First-child / next-sibling tree
  • Linked list tree
  • Implicit tree
  • Binary tree search
  • Binary search of array
  • Depth-first search: order of search, stack space used
  • Preorder, inorder, postorder

Vocabulary