Laboratory. Fundamental concepts and abstraction of data structures. The design and analysis of algorithms involving such data types and structures as stacks, queues, lists, heaps, hash tables, trees, maps, and graphs. 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 |
|---|---|---|---|---|---|---|---|---|---|
| 3/26/2026 1:01 PM | CS 3100 002 | 3 |
Arr |
Arr |
HYBRID 001 |
TURLOCK |
Hatem, Ayat |
$0.00 | WAIT |
Course Notes
Student must also enroll in CS 3100-001 (LEC) concurrently.
Hybrid Online - Synchronous. In-person class meetings will be on campus at the room, day, and time listed. Online class meetings will be at the day and time listed.