CSCI S-Q 1998 Info and Syllabus

Data Structures and Algorithms using C and UNIX

Course Info

The expanded syllabus contains more detail about the handouts, readings, and due dates. Please consult it frequently.

Readings and Schedule

Date Topics Readings Due
6/22 Course Overview, big-O Notation Weiss 1-2, Ellard 1-2 Survey
6/24 ADTs, Arrays, Lists, Stacks, Queues Weiss 3.1-3.4
6/29 Linked Types: Linked Lists, Sparse Arrays Ellard 3 (if necessary), 4, 5 Asst 1
7/1 Trees: Binary Trees, N-ary Trees, Tries Weiss 4.1-4.3, Ellard 6
7/6 Balanced Trees: B-Trees, Splay Trees Weiss 4.5-4.7 Asst 2
7/8 Heaps Weiss 6.1-6.4 Hourly 1
7/13 Searching and Sorting Weiss 7.1-7.3, 7.6-7.7
7/15 Radix Sort, Heap Sort Weiss 7.5, 7.8-7.11 Asst 3
7/20 Graphs Weiss 9.1-9.3
7/22 Graph Algorithms Weiss 9.5-9.6 Asst 4
7/27 Hashing, Hash Tables Weiss 5, Ellard 7 Hourly 2
7/29 I/O of Data Structures Ellard 8 (if necessary), 9
8/3 String Searching Ellard 10 Asst 5
8/5 Randomized Algorithms Weiss 10.4, Ellard 11 Graduate Paper (due 8/7)
8/10 Course Review (tentative) Everything.
8/12 Final Exam Final Exam


Daniel Ellard