CSCI 1103 Data Structures
This course focuses on writing scalable and performant code. In particular, we will focus on data structures: different approaches to representing and manipulating information that balance efficiency trade-offs. Students will learn to write their own C++ implementations of linked lists, hash tables, binary search trees (self-balancing), directed graphs, and other fundamental data structures. Big O notation and analysis of algorithms will be emphasized throughout so that students will be able to compare and evaluate different data structures for use in specific situations.
Course overview
- Department
- Computer Science
- School
- MCAS
- Credits
- 3
- Level
- Undergraduate
- Offered
- Annually
Catalog details
- Prerequisites
- CSCI1102
Requirements fulfilled
- Computer Science B.A.: Required computer science core (Current University Catalog; students should confirm their catalog year)
- Computer Science B.S.: Required computer science core (Current University Catalog; students should confirm their catalog year)
- Computer Science: Required Courses (Current University Catalog; students should confirm their catalog year)
Course evaluations
- Course rating
- 3.98 / 5 · Very Good
- Instructor rating
- 4.14 / 5 · Very Good
- Terms evaluated
- 3
| Term | Instructor | Course overall | Instructor overall | Well organized | Clear learning objectives | Intellectually challenging | Helpful assignments | Applicable beyond course | Attendance necessary | Weekly effort | Responses |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Spring 2026 | Duncan Levear | 4.1 | 4.3 | 4.7 | 4.8 | 4.5 | 4.4 | 4.5 | 3.9 | 4–6 hrs/week | 21 of 22 |
| Fall 2025 | Naomi Bolotin | 3.5 | 3.6 | 3.6 | 4.1 | 3.9 | 4.8 | 4.0 | 3.5 | 1–3 hrs/week | 9 of 12 |
| Fall 2022 | Robert Muller | 4.2 | 4.3 | 4.0 | 4.4 | 4.8 | 4.5 | 4.4 | 4.5 | 4–6 hrs/week | 11 of 14 |
Data freshness
Instructors
Sections
- Section 01
- Section 02
- Section 01
- Section 02