CSCI 132 / Spring 2025

Data Structures

Schedule

This schedule will give you an idea of the order of topics and chapters that will be covered. It may change during the semester depending on how quickly we cover the various topics.

Lecture slides and other handouts can be found in our Shared Drive.

TopicReadingsAssignments
1.W1/22C++ Fundamentals Chapter 1, Appendix K, Interlude 1
R1/23Lab 1: C++ Classes and Objects lab1
F1/24More C++ and ADTs Chapter 3
M1/27ADTs and Array-based Implementations Chapter 3 p1 out
2.W1/29ArrayBags
R1/30Lab 2: ADT Implementation lab2, q1
F1/31Pointers and Dynamic Memory Interlude 2
M2/3Linked Implementations Chapter 4 p2 out, p1 due
3.W2/5ADT Stacks and ArrayStacks Chapters 6, 7
R2/6Lab 3: Dynamic Memory lab3
F2/7Stack Applications
M2/10LinkedStacks p3 out, p2 due
4.W2/12ADT Queues and Linked Queues Chapters 13, 14
R2/13Lab 3 continued q2
F2/14ArrayQueues and Exception Interlude 3
M2/17ArrayQueues p4 out, p3 due
5.W2/19ADT Lists Chapter 8
R2/20Lab 4: Stacks and Queues lab4, q3
F2/21Lists continued Chapter 9
M2/24Mid-term 1 Review
T2/25(not a class day) Mid-term 1
6.W2/26Lists concluded
R2/27Lab 5: Data Structures Zoo lab5 p4 due
F2/28Recursion Chapter 2
M3/3spring break
7.W3/5spring break
R3/6spring break
F3/7spring break
M3/10Recursion again Chapter 5.3
8.W3/12Recursion concluded
R3/13Lab 6: Lists and Recursion lab6, q4
F3/14Asymptotic Efficiency I Chapter 10
M3/17Asymptotic Efficiency II p5 out
9.W3/19Asymptotic Efficiency III
R3/20Lab 7: Algorithmic Efficiency lab7, q5
F3/21Sorting Chapter 11
M3/24Simple Sorting Algorithms p5 due
10.W3/26Merge Sort
R3/27Lab 8: Sorting lab8, q6 p6 out
F3/28Quick Sort
M3/31OOP and Reuse Interldue 5
11.W4/2Trees Chapter 15
R4/3(no lab?) Mid-term 2
F4/4Binary Trees Chapter 15, 16
M4/7Binary Trees, continued p6 due
12.W4/9Binary Search Trees
R4/10Lab 9: Trees lab9, q7
F4/11Binary Search Trees, continued
M4/14Binary Search Trees, concluded p7 out
13.W4/16Dictionaries
R4/17Easter break
F4/18Easter break
M4/21Easter break
14.W4/23Academic Conferences - no classes
R4/24Lab 10: Trees and Binary Search Trees lab10
F4/25Dictionaries and Hashing Chapter 18
M4/28Hash Tables p8 out, p7 due
15.W4/30Hash Table Implementations
R5/1Lab 11: Dictionaries lab11, q8
F5/2Hashing and Hash Tables, advanced
M5/5Finals review p8 due

NB: Schedule is subject to change.