ECE 350 - Algorithms

Institution:

University of Massachusetts-Dartmouth

Subject:

Electrical and Computer Engineering

Description:

3 hours lecture Prerequisites: ECE 161; MTH 114 or MTH 112; and MTH 350 Computer algorithm design concepts, computational complexity, NP-completeness, and the design and analysis for efficient algorithms. Topics include data structures, sorting, graph, shortest path, depth first search, breadth first search, and network flow networks, computational geometry, dynamic programming, linear programming, parallel and distributed, and other state-of-the-art algorithms. The course includes group projects and presentations requiring students to design experiments to determine algorithms’ complexity as well as to design algorithms for problem solving.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.umassd.edu

Phone Number:

(508) 999-8000

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.