{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# schedule - CS/IT 352 Data Structures and Algorithms...

This preview shows pages 1–2. Sign up to view the full content.

CS/IT 352: Data Structures and Algorithms Proposed Schedule Winter 2007 Subject to Change Approx. Dates Topics Readings In-class Work Comments Jan. 9 Course Information, Introduction Jan. 11 Recursion revisited Ch. 1 Exercise 1 Jan. 16 Algorithm analysis Ch. 2 Exercise 2 Jan. 18 Asymptotics(Big-O, Theta & Omega) Ch. 2 Quiz 1 Assign project 1 Jan. 23 More asymptotics Ch. 2 Ch. 10.4.2 Exercise 3 Jan. 25 Review Q1, Discuss project, Review exercise 3 Quiz 2 Jan. 30 Abstract Data Types (ADT), Lists Ch. 3.1-3.5 Exercise 4 - lists Feb. 1 Stacks,Queues Ch.3.6-3.7 Quiz 3 Exercise 5 - stacks & queues Feb. 6 Applications for Stacks&Queues General tree structures, binary trees, traversals Ch. 4.1-4.2, 12.2 Exercise 6 - general/binary trees Feb. 8 Expression trees, binary search trees Ch. 4.3 Quiz 4 Exercise 7 - BSTs Feb. 13 Self-adjusting search trees -- AVL Ch. 4.4 Exercise 8 - AVL trees Feb. 15 Self-adjusting search trees -- finish AVL,Splay Ch. 4.5 Quiz 5 Project 1 due Assign Project 2 Feb. 20 External tree structures: 2-3trees,2-3-4 trees, B+-trees, red-black trees Ch. 4.7 Exercise 9 –

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}