CSCI 163 - Theory of Algorithms

Institution:

Santa Clara University

Subject:

Computer Science

Description:

Introduction to techniques of design and analysis of algorithms: asymptotic notations and running times of recursive algorithms; design strategies: brute-force, divide and conquer, decrease and conquer, transform and conquer, dynamic programming, greedy technique. Intractability: P and NP, approximation algorithms. Also listed as COEN 179. Prerequisites: MATH 51 or 52, or equivalent, and CSCI 61 or equivalent.

Credits:

5.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.scu.edu

Phone Number:

(408) 554-4000

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Quarter

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.