University Of Newcastle
Algorithms
COMP2230
Iowa State Course Substitution
Introduction to the Design and Analysis of Algorithms
COMS 3110
Course Info
This course introduces students to the notion of efficiency and computational complexity. The basic data structures encountered in first year, such as lists, trees and graphs, are reviewed in light of their efficiency and common usage scenario. Asymptotic measures of complexity are covered, and recurrence relations are introduced as an analytical tool. Problem-solving techniques such as the greedy strategy, divide-and-conquer, dynamic programming, and graph searching are covered. These techniques are illustrated upon optimization problems chosen for their practical relevance.
Review
- Evaluated Date:
- November 29, 2023
- Evaluated:
- Gurpur Prabhu
- Expiration Date:
- November 29, 2028
- Comments:
-
"This approval is contingent upon the student satisfying the pre-requisites for Com S 311 which are: Mimimum of C- in Com S 228, Math 166, Engl 150 and Com S 230 or CprE 310 (as stated in the catalog description). It is also contingent upon the student earning a grade which is the equivalent of C- or better in COMP2230 taken at the University of Newcastle."