Lecture. 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 001 | 3 |
MWF MWF |
10:00A - 10:50A 10:00A - 10:50A |
DBH 104 HYBRID 001 |
TURLOCK |
Hatem, Ayat |
$0.00 | WAIT |
Course Notes
Student must also enroll in CS 3100-002 (LAB) 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. Students must be available at the class times listed in the Class Schedule, and must attend in person on days indicated as such by the instructor. Students do not have the option to choose in-person or virtual, nor opt for asynchronous participation.