Final exam: cumulative, open book/notes
10:30am - 12:30pm on Tuesday May 14 in LIB 101

• Review previous questions/concepts: midterm (concepts and sample solution), lab and in-class exercises, homeworks...
• Know terminology.
• Design Question: Draw a UML diagram based on "is a" and "has a" relationships. OO Design exercise . We will go over this in class.
• Write a method that works with a collection of objects as specified (which could be an array or list or ArrayList, e.g. as in previous exam or hw or chapter 5 examples ).
• Write a method that works with stacks and/or queues.
• Trace an algorithm (showing relevant variables, e.g. show the contents of a list or stack or queue after each iteration of a given loop, or after each character is processed in a given string).
• Trace sorting algorithms (those we discussed in class, e.g. selection sort, bubble sort, insertion sort, quick sort), by writing down the list of elements after each pass.
• To be discussed: A short answer problem on trees:
  • Given a list of integers, draw a binary search tree.
  • Which nodes are visited if we search for ____ ?
  • Which nodes are visited via the preorder, inorder, postorder traversals?
• To be discussed: A short answer problem on Set and/or Map: trace code involving Set and/or Map as in DictionaryDemo.java.