Lecture Schedule

CS23

Apr. 10--May 16

Mar. 18: ADT Stack. pp. 249--269.

Mar. 20: Stack Applications. pp. 269--296. Homework 3 out

Mar. 22: ADT Queue. pp. 306--323.

Mar. 25: Simulation using a queue. pp. 324--345.

Mar. 27: Inheritance, Virtual Functions, and Late Binding. pp. 353--372.

Apr. 10: Measuring the Efficiency of Algorithms. pp. 392--405.

Apr. 12: Sorting Algorithms and Their Efficiency. pp. 405--432. Homework 3 in. Homework 4 out.

Apr. 15: ADT Binary Tree. pp. 437--468.

Apr. 17: ADT Binary Search Tree pp. 468--503.

Apr. 19: ADT Table. pp. 512--530

Apr. 22: ADT Priority Queue. pp. 530--549.

Apr. 24: Midterm 2 Review. Homework 4 in.

Apr. 26: Midterm 2.

Apr. 29: Balanced Search Trees I. pp. 556--583. Homework 5 out.

May 1: Balanced Search Trees II. pp. 583--591.

May 3: Hashing. pp. 591--614.

May 6: Graphs. pp. 620--632.

May 8: Graph Applications. pp. 632--647.

May 10: External Methods. pp. 652--686. Homework 5 in.

May 13: Open.

May 14: Final Review.

May 15: Final Examination, 11:30--2:00.