Skip to Content

CSCI 467 - Analysis of Algorithms

Institution:
Millersville University of Pennsylvania
Subject:
Computer Science
Description:
Theory and techniques of algorithm design and analysis. For design, students will study a variety of algorithmic solutions to problems from application areas including searching, selecting, sorting, graph theory, number theory and encryption. Design paradigms, including greedy method, divide and conquer, dynamic programming, backtracking and branch-and-bound. For analysis, students will use formal techniques to classify execution time of an algorithm. Software tools are used to measure resources used by a program during execution.
Credits:
4.00
Credit Hours:
Prerequisites:
C- or higher in CSCI 340.
Corequisites:
Exclusions:
Level:
Instructional Type:
Lecture
Notes:
Offered infrequently.
Additional Information:
Historical Version(s):
Institution Website:
Phone Number:
(717) 872-3024
Regional Accreditation:
Middle States Association of Colleges and Schools
Calendar System:
Four-one-four plan

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.