Lecture Slides

These slides are copyright Diane Horton, 1999. Diane Horton would like to thank Jim Clarke for allowing her to include some of his lecture material, and Michelle Craig for helping her with some revisions to the slides.

Slides used in lecture

• First set: 2 per page; and 4 per page
• Second set: 2 per page; and 4 per page

Additional Slides

• I/O in C++: 2 per page; and 4 per page
  See also:
  • slide 5 in landscape mode so it doesn't get cut off
  • program io.cxx
  • program lines.cxx
  • sample infile for programs io.cxx and lines.cxx
• Templates in C++: 2 per page; and 4 per page
  See also:
  • The code, and a makefile for compiling it.
  • Information about compiling with templates
• Makefiles: 2 per page; and 4 per page
• Direct access in C++: 2 per page; and 4 per page
  See also:
  • The handout given out in a later class
    It contains all the code in the slides (with a few more comments) and is in plain text -- so you can pull out the code and play around with it.
• One slide on BST height
• Slides on cosequential processing
• Additional slides on B-Trees
• Additional slides on indexing
• Additional slides on B(plus)-Trees
• Additional slides on external hashing
• Slides on vision hashing application
• Course review slides (last lecture)