Computer Science 211
Data Structures

Agenda

• Announcements
• Upcoming Exam
  • Exam in class on Monday, November 16
  • Generally, you are responsible for anything we covered in class or in lab assignments, and everything in the assigned reading from Java Structures, up to and including class on November 9 and Lab 6. Be sure you know how to do the lecture assignment problems and programs.
  • The exam is cumulative in the sense that the material is cumulative, but each question will focus on topics since the last exam.
  • The exam will be designed to take 75 minutes.
  • You may use one page of handwritten notes, two sides, up to 8 (1)/(2) ×11 in size. The use of other reference materials or electronic devices is a violation of the honor code.
  • This exam counts as 15% of the course grade.
  • Friday's fourth hour will be a review session.
• Lexicon lab questions and answers
• Lecture Assignment Recap
• BestOf lab recap
• Binary tree example: Huffman trees
• Array representation of trees
• Priority queues
  • Vector-based implementation

Examples

• Text example: Huffman.java
• structure5.PriorityQueue
• structure5.PriorityVector

Lecture Assignment

Due at the start of class, Wednesday, November 11.

Turn in short answers to these questions. Please turn in a hard copy (typeset or handwritten are OK). We will discuss these problems during class, so no late submissions are accepted.

1. Bailey Problem 12.22, p. 312.

Note that the other problems originally assigned at this point have been postponed until the next lecture assignment, which will not be due until November 18!