Give your most conscise answer to the following questions:

What is a data structure and abstract data type (ADT)?

Rules of recursion, what is required? How does it work--explain program stack

Why do we analyze algorithms?

- How do we classify runtime/space usage of an algorithm?

- What's Big-Oh, Big-Omega, Big-Theta and little-oh?

- Given funciton or piece of code, give its Big-Oh, Big-Omega, Big-Theta and little-oh classification

- what is meant by order of growth for functions (...,linear, quadratic, cubic,...)

- What is the Binary Search algorithm and what are its preconditions?

-- what data structure is required for the Binary Search algorithm and why?

- In general, give runtime analysis of various algorithms discussed in class or homework,

and runtimes for operations performed on data structures and abstract data types.