Final Exam Review and Study Guide

General

• 200 points (20% of your final grade)
• Yes, it will probably be challenging!
• Individual effort, no books, notes, or electronic devices
• You will have 120 minutes to complete the exam.
• Let me know if you have any need of special accommodations before taking the test.
• Use a pencil (bring one or more sharpened and ready to go)! Also bring an eraser.
• If you miss the test, you will earn a zero (unless you have prior permission or a clearly documented and incident of unforseen hardship such as illness or death in the family).

Structure and Format

• Write a java class that represents a ...
• Write a java method that ...
• Write a java code segment to ...
• Describe an algorithm that ...
• Give the following java code ... , give the output.
• Other

Content

• Chapters 1-8: Greatest Hits (25%)
• Chapter 9: Priority Queues, Heaps
  • Priority Queue
    • basic operations: insert(), removeMin(), min(), size(), isEmpty()
    • implementations: list, heap
    • priority queues sorting
  • Heaps
    • heap order property
    • complete binary tree
    • height of a heap
    • basic operations: insert(), removeMin(), min(), size(), isEmpty()
    • implementation: array
    • bottom-up construction
  • Chapter 9 problems: 1, 3, 4, 10, 11, 13, 14, 15, 17, 19, 20, 21, 22, 25, 26, 27, 29, 30, 33, 34, 37, 40
• Chapter 10: Maps
  • Map ADT
    • basic operations: get(), put(), remove(), size(), isEmpty(), entrySet(), keySet(), values()
    • implementations: Doubly-Linked List, Hash Table, Skip List
  • Hash Table
    • hash function
      • Hash Code
      • Compression Function
    • Collision handling
      • separate chaining
      • Linear probing
      • Double Hashing
  • Skip Lists
  • Big-Oh run-time complexity
  • Chapter 10 problems: 1, 6, 7, 8, 9, 23, 24, 27, 28, 33, 34, 35, 60
• Chapter 11: Search Trees
  • Binary search tree
    • insertion
    • removal
    • in-order traversal
    • Big-Oh run-time complexity
  • AVL trees
    • insertion
    • removal
    • Big-Oh run-time complexity
  • 2-4 trees
    • insertion
    • removal
    • Big-Oh run-time complexity
  • Splay trees
    • insertion
    • removal
    • Big-Oh run-time complexity
  • Red-Black
    • insertion
    • removal
    • Big-Oh run-time complexity
  • Chapter 11 problems: 1, 2, 3, 4, 5, 8, 9, 14, 15, 20, 21, 22, 23, 24, 28, 29, 42, 46, 49, 51, 57
• Chapter 12: Sorting
  • Sorting Algorithms
    • Insertion Sort
    • Selection Sort
    • MergeSort
    • Radix Sort
    • Quick Sort
  • The sorting problem in general
  • Big-Oh run-time complexity
  • Chapter 11 problems: 1, 2, 3, 4, 5, 8, 9, 14, 15, 20, 21, 22, 23, 24, 28, 29, 42, 46, 49, 51, 57

References

1. Data Structure Visualizations