EECS 215 Design and Analysis of Algorithms (2013-2014)

EECS 215 Design and Analysis of Algorithms

(Not required for any major.)
Catalog Data:

EECS 215 Design and Analysis of Algorithms (Credit Units: 4) Computer algorithms from a pratical standpoint. Algorithms for symbolic and numeric problems such as sorting, searching, graphs, and network flow. Analysis includes algorithm time and space complexity. (Design units: 0)

Required Textbook:
. Edition, , 1969, ISBN-13 978-0262033848.

Recommended Textbook:
Relationship to Student Outcomes
No student outcomes specified.
Course Learning Outcomes. Students will:
Prerequisites by Topic
Lecture Topics:


Class Schedule:

Meets for 3 hours of lecture each week for 10 weeks.

Computer Usage:
Laboratory Projects:
Professional Component
Design Content Description
Laboratory Portion:
Grading Criteria:
Estimated ABET Category Content:

Mathematics and Basic Science: 0.0 credit units

Computing: 0.0 credit units

Engineering Topics: 0.0 credit units

Engineering Science: 0.0 credit units

Engineering Design: 0.0 credit units

October 8, 2012
Senate Approved:
February 2, 2012
Approved Effective:
2012 Fall Qtr