Learning Objectives

You can demonstrate your understanding of all remaining learning objectives on exam 6, the self-scheduled final exam:

  • LD4-AD: Use the appropriate linear data structure to solve a problem in very clear pseudocode
  • CD2: Demonstrate insertion/deletion in a binary search tree
  • CD3: Demonstrate adding to a 2-3 tree
  • CD4: Identify the full sequence of BFS and DFS
  • CD5: Define the Big-O of BFS and DFS
  • CD6: Demonstrate the effects of a sequence of heap operations
  • CD7-AD: Use an appropriate complex data structure to solve a problem in very clear pseudocode (any kind of tree, graphs, heaps, priority queues)
  • CD8-AD Explain the idea behind the Big-O of BFS and DFS
  • SO1: Demonstrate quicksort on a diagram
  • SO2: Define the best and worst case Big-O of mergesort, quicksort, and heapsort
  • SO3-AD: Explain the idea behind the Big-O of quicksort
  • SO4-AD: Explain the idea behind the Big-O of heapsort

You will also be able to answer the questions from homework 8 on the final exam if you need to revise them.

You can’t bring anything with you into the self-scheduled exam, so if you would like a checklist, please fill out this form by Wednesday June 3rd at 10pm and I will print it out and include it with your packet.

Suggestions

Good ways to study for the exams are:

  • Finish any labs that you hadn’t finished or redo ones that you did finish
  • Go back over the readings/videos relevant to the learning objectives
  • Try any of the exercises at the ends of relevant chapters of the Runestone book that are about the learning objectives
  • Work on any homework revisions to make sure you fully understand the material
  • Attend the prefect sessions
  • Practice with the Exam 6 Study Bot