CSCI 280 - Algorithms and Problem-Solving Paradigms

Institution:

Hendrix College

Subject:

Description:

Introduction to algorithm design strategies that build upon data structures and programming techniques introduced in the first two computer science courses. Strategies discussed will include brute-force, divide-and-conquer, dynamic programming, problem reduction, and greedy algorithms. Particular topics to be covered will include graph traversal and shortest paths, string matching, searching, sorting, and advanced data structures such as balanced search trees, heaps, hash tables, state machines, and union-find structures. In addition, the course will include an introduction to complexity theory and the complexity classes P and NP. Prerequisites: CSCI 151 and MATH 240.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.hendrix.edu

Phone Number:

(501) 329-6811

Regional Accreditation:

North Central 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.