Laboratory. Fundamental concepts and abstraction of data structures. The design and analysis of algorithms involving such data structures as arrays, stacks, queues, lists, trees, strings, graphs, and files. Techniques for estimating the time and memory requirements of computer programs. Several large programming assignments. Prerequisite: CS 2500. (Lecture, 2 hours; laboratory, 2 hours)
| Updated1 | Course Id | Units | Day | Time | Room | Location | Instructor | Additional Course Fees |
Availability2 |
|---|---|---|---|---|---|---|---|---|---|
| 9/17/2025 9:01 AM | CS 3100 004 | 3 |
Arr |
Arr |
ONLINE 001 |
TURLOCK |
Koh, Kyu Han |
$0.00 | WAIT |
Course Notes
Student must also enroll in CS 3100-003 (LEC) concurrently.
Fully Online - Asynchronous. Online class meetings will be at no determined day and time.