Archived Content

This website is an archive of the Spring 2023 semester of CS 225.
→ Click here to view the current semester.
Back to Exams

Exam 5

There will be one programing question. The programing question will be in an enviroment identical to the PotDs. It 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 programing question will be to implement some heap functionality and to use it.

There will also be several short answer or multiple choice questions on material covered on previous exams as well as the trees topics listed below.

  • Heaps
  • Construction of a Heap
  • Heap runtime
  • HeapifyUp
  • HeapifyDown
  • Array Representation

  • Priority queue ADT

  • Graphs
  • Graph Representation
  • Graph Traversal
  • MST Algorithms Prim’s algorithm and Kruskal’s algorithm
  • Shortest Path Dijkstra’s algorithm and Floyd–Warshall algorithm

Assignments referenced:

  • mp_lists, mp_mosaics, mp_traversals
  • lab_trees, lab_heaps

Points:60

Registration: Thursday, April 06

Start: Sunday, April 23

End: Tuesday, April 25