EECE 7205 — Fundamentals of Computer Engineering

4 semester hoursGraduateLectureusually offered: fall, springtypical days: TBostonOnlinePortland, MaineSeattle, WALive CastTraditionalVideo Streaming

Introduces fundamental techniques in computer engineering used throughout the graduate curriculum. Covers basic programming and analysis methods and the formulation and solution of a wide range of computer engineering problems. Also discusses the applications of algorithm analysis and complexity theory to analyzing and solving problems. Emphasizes those fundamental computational problems and related algorithms whose solution can be obtained in polynomial time. For basic computational problems such as sorting, searching, elementary graph algorithms, shortest-paths problems, as well as flow problems in networks, many different algorithms and data structures are described and analyzed, implemented, and compared both from a theoretical and from an experimental point of view.

Offering history

TermSectionsEnrolledCapacityFullOpen seats/section
Fall 202348720343%29.0
Spring 202445824324%46.3
Fall 2024410122944%32.0
Spring 202522917517%73.0
Fall 202537613058%18.0
Spring 202623715923%61.0

Snapshots from scheduled scrapes — not live seat availability. "Full" can exceed 100% when sections over-enroll.

Meeting times

Share of recent sections by weekday: M 31% · T 63% · W 12% · Th 29% · F 46%

Common patterns: TF (46% of sections), MR (21% of sections), MW (10% of sections), T (9% of sections), TR (7% of sections), async (4% of sections) — in patterns, R means Thursday

Professors

Fall

Spring

Percentages are each professor's average share of the season's enrolled students in recent terms.

Unlocks

CS 6240, DS 5500, EECE 5641, EECE 7368, EECE 7376, IE 7275

Courses that list EECE 7205 in their prerequisites.

Links

Official catalog (EECE course descriptions) · Student reviews on RateMyHusky · All EECE courses · Plan it at numap.app