CPSC 170 Spring 2004
Test 3 Topics

• Recurrence Relations
  • Defining recurrence relations for given word problems
  • Finding closed form solution use the expand-guess-verify method

• Collections
  • ADT vs. implementation
  • Iterators
  • Bags, Stacks, Queues, Sets
  • Linked and array implementations of linear collections

• Assorted
  • Infix, prefix, postfix representation of expressions
  • Stack evaluation of postfix expressions
  • Creation and manipulation of linear linked structures