Algorithms Computing

AY2020/2021 Semester 2

This course aims to give you a systematic introduction to data structures and algorithms for constructing efficient computer programs. Emphasis is on data abstraction issues in the program development process, and on the design of efficient algorithms. Simple algorithmic paradigms such as greedy algorithms, divide-and-conquer algorithms and dynamic programming will be introduced. Elementary analyses of algorithmic complexities will also be taught. Course Content: - Run Time Notations and Complexities - Algorithm Analysis - Data Structures: List, Stack, Queue, Tree, Binary Search Tree - Sorting: Quick Sort, Merge Sort - Greedy Methods - Divide-and-Conquer - Dynamic Programming