Computer Science 385
Analysis of Algorithms

Spring 2011, Siena College

Home     Syllabus     Schedule

Agenda

• Announcements
  • Class as usual Thursday: guest lecture by Dr. Lim about string matching
• Binary Search Trees
  • basics of BSTs
  • tree sort
  • balanced trees
  • AVL trees

Lecture Assignment 15

Due at the start of class, Thursday, March 10.

Please submit answers to these questions either as a hard copy (typeset or handwritten are OK) or by email to jteresco AT siena.edu by the start of class. Please use a clear subject line when submitting by email (e.g., CS 385 Lecture Assignment 15, Joe Student). We will discuss these questions at the start of class, so no late submissions are accepted.

This is a longer-than-usual lecture assignment, so please plan accordingly.

1. Levitin Exercise 5.2.1, part b, p. 170-171.
2. Levitin Exercise 5.2.4, p. 171.
3. Levitin Exercise 5.3.1, p. 176.
4. Levitin Exercise 5.6.7, p. 195.
5. Levitin Exercise 5.6.8, p. 195.