Computer Science 501
Data Stuctures and Algorithm Analysis
Fall 2013, The College of Saint Rose
Lecture 11: Priority Queues; Graphs
Date: Wednesday, November 13, 2013
Agenda
- Announcements
- Lecture 10 assignment recap
- Lab 8: Tree Problems [HTML] [PDF] out (last lab - no programming)
- Programming Project 3: Dijkstra's Road Trip [HTML] [PDF] out
- Array representation of trees
- Priority queues
- Vector-based implementation
- heaps
- heap-based priority queue
- Heapsort
- Graphs
- definition and terminology
- graph structures: directed/undirected, adjacency matrix/adjacency list
Lecture 11 Assignment
Due at the start of class, Wednesday, November 20.
Please submit answers to these questions
in Submission
Box under "LA11" by the start of our next
class. We will discuss these questions at the start of class, so no
late submissions are accepted. Please be sure that your name is
clearly indicated in all submissions.
- Bailey Problem 13.2, p. 338. (3 points)
- Bailey Problem 13.12, p. 339. (3 points)