COMPSCI 320 - Applied Algorithmics
Faculty
Science
Department
Computer Science
Points:
15
Available Semesters:
{}
Course Components
Labs
Tutorials
Lectures
Exam
TBLs
Workshops
Description: Fundamental design techniques used for efficient algorithmic problem-solving and software development. Methods that yield algorithms that are both provably correct and efficient. Efficiency of algorithms to provide a basis for deciding which algorithm is best for the job. Limits on the power of computers and the theory of NP-completeness. An introduction to methods whose correctness or performance is not guaranteed.
Prerequisites / Restrictions
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
Average Rating From 0 Reviews
Teaching Quality
-
Content Quality
-
Workload
-
Difficulty
-
0% - Would Recommend
0% - Would Not Recommend
Reviews