Back to Exams

Exam 5

The exam will consist of multiple choice questions and one coding question. There will be no free response question on this exam. The coding question will require programming complete and correct C++ programs. Partial credit will only be given for working, compilable code that passes some test cases. Code that doesnt compile will not receive any credit. Multiple (but not unlimited) submissions will be allowed.

The coding question will require you to write and use an iterator on a tree (not a graph). There will be a practice question in PL but you are also strongly encouraged to review the iterators you have built in earlier MPs.

The topics on the exam include all material through Friday November 15. While earlier material may show up, the focus is on the following topics:

  • Graphs
    • Graph Implementations
    • Graph Traversal
    • MST Algorithms Prim’s algorithm and Kruskal’s algorithm
    • Shortest Path Dijkstra’s algorithm and Floyd–Warshall algorithm
  • Fundamentals of Probability in CS
  • Hashing
    • Properties of a hash function
    • SUHA
    • Types of Hashing
    • Resizing a hash table

Assignments referenced:

  • mp_lists, mp_mosaics, mp_traversals, mp_mazes
  • lab_ml, lab_flow, lab_hash
  • lab_dict (less relevant to the broad topics than other three listed labs but may still show up)

Points:60

Registration: Thursday, November 21

Start: Wednesday, December 04

End: Friday, December 06