Please Enable JavaScript in your Browser to visit this site

COS 431

Algorithm and Complex Analysis

Basic algorithmic analysis: Asymptotic analysis of upper and average complexity bounds, standard complexity classes, time and space tradeoff in algorithms analysis, Algorithm strategies: Brute force, greedy, divide and conquer, recursive, backtracking, dynamic programming, heuristics, reduction (transform and conquer); Implementation of data structure. Fundamental computing algorithms: Numerical algorithms, sequential and binary search algorithms, sorting algorithms, binary search trees, hash tables, graphs and its representation.

Course Code
COS 431
Department
Computer Science
Campus
Sumas University
Level
400 Level, Undergraduate
Instructor
Sumas University Lecturer
Semester
First Semester
Credit
3 Units
Method
Lecture