Study Guide for CS 313E Test 2 (Spring 2014)

* Define simple classes

* Recursion - includes back tracking. Look at Recursion-2 
  problems in the Java section of Coding Bat.

* Simple Turtle Graphics design and interpretation.

* The questions on the test will involve the algorithms that
  we covered and the following data structures - stacks, queues,
  and linked lists 

* You should be familiar with the following sorting algorithms -
  selection sort, bubble sort, insertion sort, merge sort and
  quick sort. You should be able to trace each of the algorithms
  for a given array.

* You should be able to apply the Stack or Queue class to solve
  simple problems, like RPN or balancing parenthesis. 

* You should be able to add to the functionality of the LinkedList
  class, modify the LinkedList class (think Circular Lists or
  Doubly LinkedList), or apply the LinkedList class to solve simple
  problems, like linked list representation of polynomials or 
  adding functionality to the sparse matrix class.

* You may bring a cheat sheet (8.5" x 11") with you with hand written
  notes on both sides of the paper.