Computer Science 210

Data Structures

Fall 2016, Siena College

Agenda

- Announcements
- Lab practical exam discussion postponed to next week
- Lab 9: Best Of continues, now due Monday, 11/28 before class (but try to get it done before you leave)

- Exam 2 next week
- during labs on Wednesday, November 30
- optional review session, 7:15 PM Tuesday, November 29, RB 340
- material is cumulative by nature, but will focus on topics since Exam 1 (vectors, linked lists, searching and sorting, linear structures, ordered structures, trees, general data structure design)
- same format and rules as Exam 1: closed book, closed notes, all written, no resources except those that come with the exam paper
- practice exam out, solutions will be posted by my office on Monday

- Lecture 30 assignment recap
- Array representation of trees
- Priority queues
`Vector`-based implementation

- Heaps

Due at the start of class, Monday, November 28.

Please submit answers to these questions by the start of class. zyBook activities should be done right in your zyBook, and all others should be submitted to Blackboard under "Lecture 31 Assignment" . We will discuss these questions at the start of class, so no late submissions can be accepted.

- Bailey Problem 13.2, p. 338 (4 points)
- Bailey Problem 13.4, p. 338 (3 points)
- Bailey Problem 13.6, p. 338 (3 points)
- Complete the participation activities in Section 17.2 of your zyBook. (5 points)

Terminology

- balanced
- priority queue
- heap
- min-heap
- max-heap