CSE 340 - Design and Analysis of Algorithms spring

Institution:

Lehigh University

Subject:

Description:

Algorithms for searching, sorting, counting, graph and tree manipulation, matrix multiplication, scheduling, pattern matching, fast Fourier transform. Minimum time and space requirements are established, leading to the notion of abstract complexity measures and the intrinsic complexity of algorithms and problems, in terms of asymptotic behavior. The question of the correctness of algorithms is also treated. Prerequisites: MATH 22 and CSE 261 (MATH 261).

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.lehigh.edu

Phone Number:

(610) 758-3000

Regional Accreditation:

Middle States Association of Colleges and Schools

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.