Computer Science 102L:
Data Structures (3.0 units)
Linear lists, strings, arrays, and orthogonal lists; graphs, trees, binary trees, multilinked structures, sorting techniques; dynamic storage allocation; applications.
- Prerequisite: CSCI 101
Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
---|---|---|---|---|---|---|---|---|---|
30395D | 001 | Lecture | TBA | TBA | Canceled | TBA | ![]() ![]() | ||
29911R | 001 | Lecture | 12:30-1:50pm | Tue, Thu | Canceled | ![]() ![]() ![]() | |||
29912R | 001 | Lab | 5:30-6:50pm | Wednesday | Canceled | ![]() | |||
29915R | 001 | Lab | 12:00-1:50pm | Friday | Canceled | ![]() | |||
30271R | 001 | Lab | 2:00-3:50pm | Tuesday | Canceled | ![]() | |||
30399R | 001 | Lab | 5:00-6:50pm | Thursday | Canceled | ![]() |