linden.study

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

Catalog text is imported from the reviewed Boston College course snapshot. Confirm eligibility in EagleApps.

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)

Requirement eligibility can vary by school, cohort, and section. Confirm the selected section in EagleApps or with an advisor.

Official evaluation summary

3.98 / 5

Based on 41 aggregate responses from BC Avalanche/Blue evaluations.

Data freshness

Course and evaluation data last updated 2026-08-02. Source details and limitations are documented in Data Sources and Methodology.

Instructors

Sections

  • Section 01
    Fall 2026 · Charles Wiseman · 245 Beacon Street Room 125 MWF 12:00 Noon-12:50PM · Offered
  • Section 02
    Fall 2026 · Alexander Creiner · 245 Beacon Street Room 205 MW 04:30PM-05:45PM · Offered