MTH U230 - Discrete Mathematics

Institution:

Northeastern University

Subject:

Description:

Provides the discrete portion of the mathematical background needed by students in electrical and computer engineering. Topics include Boolean algebra and set theory, logic, and logic gates; growth of functions, and algorithms and their complexity; proofs and mathematical induction; and graphs, trees, and their algorithms. As time permits, additional topics may include methods of enumeration and finite-state machines.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.northeastern.edu

Phone Number:

(617) 373-2000

Regional Accreditation:

New England Association of Schools and Colleges

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.