University of Toronto - Spring 2001
Department of Computer Science
CSC 191: Computer Algorithms, Data Structures, and Languages
Lecture Slides
Here are the slides we've used so far in lectures:
- Makefiles:
2up (pdf and ps);
4up (pdf and ps)
- Review of C++ basics:
2up (pdf and ps);
4up (pdf and ps)
- C++ static members:
2up (pdf and ps);
4up (pdf and ps)
- Recursion:
2up (pdf and ps);
4up (pdf and ps)
- Reasoning about Programs:
2up (pdf and ps);
4up (pdf and ps)
- Efficiency Analysis:
2up (pdf and ps);
4up (pdf and ps)
- Class templates in C++:
2up (pdf and ps);
4up (pdf and ps)
See also:
- Design by Contract:
2up (pdf and ps);
4up (pdf and ps)
- File I/O in C++:
2up (pdf and ps);
4up (pdf and ps)
See also:
- the od output from slide 135 (it is cut off
on the slide due to its width)
- program io.cxx
- program lines.cxx
- sample infile for programs io.cxx and
lines.cxx
- Hashing:
2up (pdf and ps);
4up (pdf and ps)
- Direct Access to Files:
2 up
(pdf
and
ps);
4 up
(pdf
and
ps);
And some code from these slides:
- Incremental hashing:
2up (pdf and ps);
4up (pdf and ps)
See also this
animation of tree rotations. Note that the animation applet does not
force trees to be AVL trees; but it let's you watch what happens
during a rotation.
All slides are copyright Diane Horton 2001, except where noted.