Lecture 36.
I completed the term review for the
final. I surveyed the different types of search trees used this term. We also
looked at some open ended problems that explore the used of different data
structures for solving problems.
I have prepared some problems
based on the material in Chapter 15 for you to work on in preparation for the
final test.
Chapter 15 exercise
15.2 and 15.3 15.4 and
Consider the
graph in figure 15.1. Can a topological ordering of the graph be
obtained?
If not suggest some changes to the
graph that would permit a topological ordering.
Explain
This concludes the
regular lectures for CISC-235 Winter 2005.
There will be one additional review
session on Monday April 18 from 10:30 -12:00. I will announce the room number
on this web log.
There will also be a
review session run by Prof. Mary McCollom on Wednesday April 20 at 2:00-4:00.
Room to be announced also on this web log.
Posted: Fri - April 8, 2005 at 02:20 PM