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.