(Latest Revision: 05/20/2001)
Week 14 Notes for CS 2500, Section 001 -- Spring 2001
CS 2500, Section 001, Monday, May 21, 2001
- Look at Upcoming Schedule
- Class starts at 10:10. I take roll at 10:20
- Announcement(s)
- I posted "make-up" grades on program #3
-
- Discuss array-based representation of BT and BST
- Discuss efficiency of search in pointer-based BST: worst case, best
case, average case
- Discuss "average" binary search trees.
- Discuss balanced binary search trees.
-
CS 2500, Section 001, Wednesday, May 23, 2001
- Look at Upcoming Schedule
- Class starts at 10:10. I take roll at 10:20
- Announcement(s)
- QUIZ #3 TODAY
- Today is the last day of this class
- Don't forget to send me an e-mail if you are going to be taking
the make-up final exam.
-
-