Course schedule

The table below gives the material covered in class, and points out a corresponding section in the text book (Sedgewick).

Date Material Comments and References
Jan. 11 Administrative issues Syllabus handed
Jan. 13 What is an efficient algorithm;
Frequency Count
Chap. 1
Jan. 15 Worst-case and Average-Case Complexity Chap. 2.2
Jan. 18 Martin Luther King Holiday
Jan. 20 Growth of Functions Chap. 2.3
Jan. 22 Big-O-notation Chap. 2.4
Jan. 25 Mathematical Induction Chap. 5.1 and lecture
Jan. 27 Induction -Examples Chap. 2.5
Jan. 29 Induction - Netwon Coefficient Chap. 2.6
.
Feb. 1 Abstract Data Structures Chap. 4.1
Feb. 3 Arrays Chap. 3.2
Feb. 5 Arrays - Applications lecture
Feb. 8 Dynamic Data Sets lecture
Feb. 10 Stacks and Queues Chap. 4.2-4.4
Feb. 12 Applications: Evaluation of Expressions lecture
Feb. 15 Linked Lists Chap. 3.3
Feb. 17 Linked Lists Chap. 3.4-3.5
Feb. 19 Applications of Linked Lists Chap. 3.6-3.7
Feb. 22 Trees - definition Chap. 5.4
Feb. 24 Trees -Properties Chap. 5.5
Feb. 26 Trees - Continuation lecture
.
Mar 1 Trees -- representation Chap. 5.4
Mar 3 Trees Traversals Chap. 5.6
Mar 5 Trees Applications: Huffman's Code lecture
Mar 8 Trees Applications: Continuation lecture
Mar 10 Trees Applications: Continuation lecture
Mar 12 NO CLASS make up for the evening exam
Mar 13-20 NO CLASS Spring Break
Mar 22 Trees Applications: Set Representations Chap 1.3 <--
Mar 24 Find-Union Chap 1.3
Mar 26 Heap Chap 9.1-9.2
Mar 29 Heap Chap. 9.3-9.4
Mar 31 Binary Search Trees Chap. 12
.
April 2 Binary Search Trees Chap. 12.5
Apr 5 Binary Search -- Average Case Analysis Chap. 12.6
Apr 7 2-3 Trees Chap. 13
Apr 9 AVL trees Chap 13.4
Apr 12 Hashing - Definitions Chap. 14
Apr 14 Hashing - Analysis Chap. 14
Apr 16 Digital Search Trees Chap. 15
Apr 19 Graphs Definitions lecture
Apr 21 Graphs -Representations lecture
Apr 23 Grpahs Traversals Chap. 5.8
Apr 26 Spanning Tree lecture
Apr 28 Shortest Paths in Grpahs Aho et al. Chap. 6.3
Apr 30 Shortest Paths and Greedy Algorithms Aho et al. Chap. 6.4