CS 328 - Theory of Algorithms

Institution:

King's College - Pennsylvania

Subject:

Computer Science

Description:

This course is an introduction to the techniques for designing efficient computer algorithms, proving their correctness, and analyzing their running times. General topics include asymptotics, solving summations and recurrences, algorithm design techniques (such as divideand- conquer, dynamic programming, and greedy algorithms), analysis of data structures, sorting, searching and selection, and an introduction to NP-completeness. Offered Fall semesters. Prerequisites: CS*233 and MATH*235 or consent of the instructor.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.kings.edu

Phone Number:

(570) 208-5900

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.