Review for Exam 1

1
Review for Exam 1

• Topics covered
• Asymptotic analysis
• ADT and template class/functions
• Lists and list implementations
• Deques, queues, and stacks.
• For each of these data structures
• Basic idea of data structure and operations
• Be able to work out small example problems
• Advantages and limitations
• Asymptotic time performance of their operations
• Comparison

2
Review for Exam 1 (cond)

• Asymptotic analysis
• Best/Worst/Average performance (time and space)
• Big-O notation and properties
• Definition
• Lower order terms, constant coefficients
• Sum rule, product rule (be careful)
• Loop, consecutive statements, conditional
  statements
• Proofs
• Growth rates of commonly used functions
• Constant/logarithm/polynomial/exponential
• LHospitals rule

3
Review for Exam 1 (cond)

• ADT and template class/functions
• What are template classes, how they differ from
  regular classes
• why need them
• Lists
• List ADT.
• Basic operations and their time performance
• List iterators.
• List implementation
• Linked list and doubly linked
• Vector

4
Review for Exam 1 (cond)

• Deques, queues, and stacks
• ADT and operations (and their time performance)
• Implementation
• Layering/adaptor
• How this design pattern works
• Pros and cons
• Vector (circular for Deques and queues)

5
Review for Exam 1 (cond)

• Types of questions
• Similar to those of the supplementary questions
  on the wed (under Practice Exercises)
• Definitions
• Short questions
• Coding (some may require using operations already
  defined in the class)
• Applying operations to specific example problems
• Proofs