EECE 2560 — Fundamentals of Engineering Algorithms

4 semester hoursUndergraduateLectureusually offered: fall, springtypical days: M/ThBostonTraditional

Covers the design and implementation of algorithms to solve engineering problems using a high-level programming language. Reviews elementary data structures, such as arrays, stacks, queues, and lists, and introduces more advanced structures, such as trees and graphs and the use of recursion. Covers both the algorithms to manipulate these data structures as well as their use in problem solving. Introduces algorithm complexity analysis and its application to developing efficient algorithms. Emphasizes the importance of software engineering principles.

Prerequisites

Offering history

TermSectionsEnrolledCapacityFullOpen seats/section
Fall 20231475290%5.0
Spring 20241556881%13.0
Summer A 20241175034%33.0
Fall 20241505296%2.0
Spring 20251416563%24.0
Summer A 20251114028%29.0
Fall 20251436072%17.0
Spring 20261667094%4.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 80% · T 25% · W 47% · Th 60% · F 20%

Common patterns: MWR (42% of sections), M (20% of sections), TF (20% of sections), MR (13% of sections), MTWR (5% of sections) — in patterns, R means Thursday

Professors

Fall

Spring

Summer A

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

Unlocks

CS 3100, CS 3200, CS 3650, CS 4300, EECE 4520, EECE 4790, EECE 4791, EECE 5360, EECE 5550, EECE 5643, EECE 5645, EECE 7376, FINA 4340, FINA 4350, FINA 4390, MUST 4600

Courses that list EECE 2560 in their prerequisites.

Links

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