CS 251

Data Structures

Computer Science

4 credit hoursUsually offered: Fall, Spring

Avg GPA

2.78

Easiness

2.10

Total regs

3,537

Grade Distribution

Spring 2022–Summer 2026 · Percentages use A–F and W outcomes

Avg GPA

2.78

40.6%

1436

26.8%

948

14.6%

517

6.4%

227

4.4%

154

7.1%

251

A–F + W

3,533

Other outcomes

All registrations

3,537

Quick Insights

Avg GPA

2.78

Easiness

2.10

C or better

88.4%

Among A–F outcomes

D or better

95.3%

Among A–F outcomes

Withdrawal rate

7.1%

Among A–F and W outcomes

Most common grade

Letter grades only

Outcomes counted

3,533

A–F and W outcomes

CS 251 by Professor

Ranked by historical GPA for 2024SP–2026SP · A–F outcomes only · minimum 20 graded outcomes

Dey, Drishika

3.34

RMP

4.0

15 reviews

Graded

222

Total regs

229

GU, Zhaochen

2.97

Keep Exploring

Keep exploring

Compare a professor, browse nearby courses, or ask Sparky.

Best professor lead

Dey, Drishika

Top GPA signal with 222 grades.

Avg GPA 3.34Open profile →

More from CS

CS 151

Foundations of Computing

CS 211

Programming Practicum

Decision shortcut

Ask Sparky about this class

Get a quick summary of difficulty, fit, and professor picks.

Ask Sparky →

About This Class

Design, usage and analysis of data structures: review of lists, stacks and queues; hash tables, priority queues, search trees, introduction to graphs; searching and sorting; runtime analysis; programming projects and lab exercises. Course Information: 4 hours. Prerequisite (s): Grade of C or better in CS 141 or Grade of C or better in CS 107 ; and Grade of C or better in CS 151 ; and Credit or concurrent registration in CS 211 or Credit or concurrent registration in ECE 266 . Class Schedule Information: To be properly registered, students must enroll in one Lecture-Discussion and one Laboratory.