CSSE 230: Session Notes - Day 23

Topics

  1. Evaluation of sorted datastrucures with hashtables and linked lists.
  2. Minimum spanning tree (MST) of a graph
  3. Prim's algorithm to find an MST
  4. Kruskal's algorithm to find an MST

Outline

  1. [5 min] Contact before work
  2. [10 min] Evaluation of sorted datastrucures with hashtables and linked lists.
  3. [5 min] Spanning tree
  4. [10 min] Minimum spanning tree
  5. [10 min] Prim's algorithm for finding an MST
  6. [10 min] Kruskal's algorithm for finding an MST
  7. [10 min] Discusson of pair project
  8. [10 min] Introduction to prompt engineering and my experience with it when developing solutions to the programming assignments for this course.
  9. [balance of time] Work on pair project.

Resources