Back to Quizzes

Exam 5

There will be one programing question. The programing question will be working with heap implementations. There will also be some short answer/multiple choice questions covering recient material.

Topics Covered

  • Heaps
    • Construction of a Heap
    • Heap runtime
    • HeapifyUp
    • HeapifyDown
    • Array Representation
    • Priority queue ADT
  • Hash Table
    • Hash functions
    • Properties of a good hash function
    • SUHA
    • Hash Table Array
    • Load Factor
    • Hash Table Collisions
    • Open Hashing vs. Closed Hashing
    • Separate Chaining
    • Linear Probing
    • Double Hashing
    • Re-Hashing
    • Runtime of a hash table, in terms of n
    • Load factor’s impact on running times
    • Properties of a good hash table
  • Graphs
    • Graph Representation
    • Graph Traversal
    • MST Algorithms Prim’s algorithm and Kruskal’s algorithm

Points:60

Start: Monday, November 28

End: Wednesday, November 30