**Monday, April 30th**- Go over the code of the PQStudent program.
- Go over the code of the PQCustomer program.
- Review for the Chapter 12 Test.
- Assignments:
- Review the following for the Chapter 12 Test Wednesday:
- Chapter 12 Lecture Part 1: Repair to Minimum Heap Example.
- Repair to Minimum Heap Worksheet #1 Key.
- Repairing a Priority Queue Minimum Heap after a Removal or Insertion.
- Repair to Minimum Heap Worksheet #2 Key.
- Full Version of Heap Sort Phase 1 and Phase 2.
- HeapSort Worksheet Key.
- The Chapter 12 Online Lecture in particular:
- Slides 3 - 11, 18-21, 33-42. (But I would suggest reading over everything)

- Heap Sort Multiple Choice Review Question Key

- Chapter 12 Quiz Break Down (73pts):
- 13 Multiple Choice Questions (13pts)
- 4 True-False Questions that have multiple parts. (13pts)
- One short essay question where you explain both phases of Heap Sort.
- Be able to write the code to declare and construct a java.util.PriorityQueue<E> given the comparator for a particular class.
- One coding question where you take objects from one data structure and place them in a priority queue based on a comparator class.
- Complete one set of diagrams on either Repair to Maximum Heap, Repair to Minimum Heap, Add and/or Remove from a Minimum Heap.
- Complete a diagram tracing both phase 1 and phase 2 of HeapSort.

- Review the following for the Chapter 12 Test Wednesday:

**Wednesday, May 2nd**- Chapter 12 Test.
- Discuss the Final Exam and confirm the date.

- Assignments:
- Begin studying these items for the ACP Final Exam:
- Be able to tell how many checks BinarySearch will make to find a value in a sorted array and what the final values of left and right will be.
- Be able to complete a diagram to show the state of an array after the first partitioning by QuickSort.
- Be able to complete a Comparator class that is associated with some model class. Review the following:
- Country.java and PopulationComparator.java
- Student.java and GPAComparator.java
- Customer.java and PriorityComparator.java

- Be able to complete a Diagram/Worksheet for a Simple Iterator.
- Be able to complete a Diagram/Worksheet for a List Iterator.
- Be able to give the Big O running time for the key methods of an ArrayList or LinkedList, a stack, a queue, a BST, a HashMap or HashSet, or a Priority Queue.
- Be able to write the code for a method that uses a Doubly-Linked List to manipulate a DLL that uses ListNode objects in some way.
- Be able to write the code for a simple stack or queue operation that acts upon one or both of these when they are templated for certain kinds of objects.
- Be able to tell the preorder and postorder of a BST given a set of values that will be added to the BST.
- Be able to write the code for a TreeSet or TreeMap operation that acts upon one or both of these when they are templated for certain kinds of objects.
- Be able to write the code for a HashSet or HashMap operation that acts upon one or both of these when they are templated for certain kinds of objects.
- Be able to complete a diagram to arrange the values in an array into a Minimum Heap.
- Be able to answer True or False questions like the ones that have previously appeared on Chapter Tests.
- Be able to answer Multiple Choice questions like the ones that have previously appeared on Chapter Tests.

- Begin reviewing for the Final Exam by completing the Review Worksheets in the Review Packet.

- Begin studying these items for the ACP Final Exam:

**Thursday, May 3rd**- Hand back and go over the Chapter 12 Test.
- Begin completing the Review Worksheets in the Final Exam Review Packet. Check your answers by going to the following link: Final Exam Review Page
- Final Exam breakdown (100pts ... worth 1/7 of the course grade):
- 1 Binary Search question like the review sheet
- 1 QuickSort diagram question like the review sheet
- 1 Coding question where you write the compare method of a Comparator class
- 1 Draw the Binary Search Tree question and give the preorder and postorder traversal
- 1 Minimum Heap Diagram question where you complete the repairing of tree of values then remove and add values
- 1 Simple Iterator Diagram question
- 1 List Iterator Diagram question
- 23 Multiple Choice questions
- 2 Coding questions where you write an entire method to complete an operation on data stored in a data structure

- Assignments:
- Review what will be on the ACP Final Exam:
- Be able to tell how many checks BinarySearch will make to find a value in a sorted array and what the final values of left and right will be.
- Be able to complete a diagram to show the state of an array after the first partitioning by QuickSort.
- Be able to complete a Comparator class that is associated with some model class. Review the following:
- Country.java and PopulationComparator.java
- Customer.java and PriorityComparator.java

- Be able to complete a Diagram/Worksheet for a Simple Iterator.
- Be able to complete a Diagram/Worksheet for a List Iterator.
- Be able to tell the preorder and postorder of a BST given a set of values that will be added to the BST.
- Be able to complete a diagram to repair the values in an array into a Minimum Heap.
- Be able to answer Multiple Choice questions like the ones that have previously appeared on Chapter Tests.
- You should be able to identify the definition of a Set and a Map.
- Be able to give the Big O running time for the key methods of an ArrayList or LinkedList, a stack, a queue, a BST, a HashMap or HashSet, or a Priority Queue.
- Be able to recognize the proper way to traverse a SinglyLinkedList using a for loop if you want to traverse the entire list or if you want to stop on the last node in the list ... Slides 24 - 26 of the Chapter 8 Online Lecture.
- Be able to write the code for a simple stack or queue operation that acts upon one or both of these when they are templated for certain kinds of objects.
- Be able to write the code for a TreeSet or TreeMap operation that acts upon one or both of these when they are templated for certain kinds of objects.
- Be able to write the code for a HashSet or HashMap operation that acts upon one or both of these when they are templated for certain kinds of objects.

- Review what will be on the ACP Final Exam:

**Friday,****May 11th**- Final Exam at 10am until 11:45.
- Assignments:
- You're DONE!