CSCI 3650 Quiz 1 Information

***************************************************************************
Date: Wednesday February 5

Things to Bring

1. Something to write with.  Answers will be written on the exam pages.

2. (Optional): 1 page of handwritten notes.  You may use the front and back of
your piece of paper for notes.

***************************************************************************
Relevant Topics (all material through January 31---1st 3 chapters of text)

1. Tracing execution of algorithms.
2. Expressing (writing/specifying) an algorithm.
3. Asymptotic Analysis of Run-time Behavior
4. Asymptotic Fundamentals (Theta, Big-O, Big-Omega)

***************************************************************************
Additional Information

1. Definitions are only a foundation.  Demonstrating understanding through
   problem-solving is essential.  Examples of such problem-solving
   applications  include the following.

   -- What input would cause behavior X?
   -- How is run-time effected by a given algorithm modification?
   -- How does input constraint Y effect run-time performance?
   -- What is the relationship between input property P and run-time 
      performance?

2. Practice exercises, both those specified in the WWW page, and other
   exercises provided in the text are helpful.  Try to work them without
   consulting the text/notes.  The key concepts you struggle to remember are
   probably candidates for your notes page.