Review%20for%20Exam%202

1
Review for Exam 2

• Andy Wang
• Data Structures, Algorithms, and Generic
  Programming

2
Generic List Class and Linked Lists

• List vs. Vector vs. Deque
• Runtime complexity of Size()
• How to use a TListltTgt
• Why multiple iterators for a given list
• How to implement PushFront, PushBack, PopFront,
  PopBack, Insert, Remove

3
Generic Positional Containers and Double-Ended
Queues

• pContainers vs. aContainers
• How to compute the size of a deque
• Cases to expand a deque
• How to implement PushFront, PushBack, PopFront,
  PopBack

4
Stacks and Queues

• Definition for ADT
• Convert infix to postfix notation (conceptual
  level)
• Implement postfix evaluation using stack DFS vs.
  BFS
• Full implementation of stack and queue adaptor
  classes

5
Function Classes and Objects

• Advantages of function objects
• Implementions of predicate classes
• Declare a function pointer foo, which takes an
  argument of type yaddy and returns type yadda

6
Generic Algorithms

• Implementions of generic copy, find, max, sort
• Running time of generic sort

7
Iterators

• Types of iterators and when to use what
• Implementions of an append iterator

8
Generic Set Algorithms

• Conceptual understanding of set operations
• Union operation vs. merge operation
• How to use set union to sort
• Runtime complexity
• Implementations of union, intersection,
  difference, containment, merge

9
Generic Associative Containers and Sorted Lists

• Access by values
• Insert(t)
• Remove(t)
• Multimodal vs. unimodal associative containers