Data Structures and Algorithms
Hash tables, heaps, balanced trees, graphs. Sorting, dynamic programming, greedy algorithms, NP-completeness.
CS Major Core
Workload
20
hrs / week
above EECS avg (17.0 hrs)
Difficulty
5/5
Very hard
above EECS avg (4.7)
Median grade
B
mean 3.1 GPA
below EECS avg (3.36 GPA)
% earning A
33%
A+, A, or A−
Grade distribution
Median B · Mean 3.10 GPA
2%
13%
18%
23%
22%
12%
5%
3%
1%
1%
A+
A
A-
B+
B
B-
C+
C
C-
D+
D
D-
E
Prerequisites
- · EECS 280
- · EECS 203
Sections
| Section | Professor | Meets | Enrollment |
|---|---|---|---|
| 001 | Marcus Darden | MWF 11:00–12:00 | 240/250 |
Similar courses in this subject
- EECS 200·3 crElectrical Engineering Systems Design I12hrs/wk3/5diffBmedian33%%A
- EECS 201·3 crComputer Science Pragmatics12hrs/wk3/5diffBmedian33%%A
- EECS 203·3 crDiscrete Math12hrs/wk3/5diffBmedian33%%A
- EECS 215·3 crIntroduction to Electronic Circuits12hrs/wk3/5diffBmedian33%%A
- EECS 216·3 crIntroduction to Signals and Systems12hrs/wk3/5diffBmedian33%%A
- EECS 230·3 crEngineering Electromagnetics12hrs/wk3/5diffBmedian33%%A
Resources for EECS students
How to read these numbers
- Workload — total hours/week including lecture, assignments, and exam prep.
- Difficulty (1–5) — conceptual rigor and pace, not just hours.
- Median grade — the middle student's final letter; mean GPAaverages everyone's grade points.
- % earning A — share of students finishing with A+, A, or A−.
- Comparisons are against this subject's average, so you can tell whether a number is high for the discipline.