Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy ...

The student is also exposed to the notion of a faster algorithm and asymptotic complexity through ... that allows for efficient search and retrieval from large amounts of data. We will learn about the ...

Examination of problem areas such as searching and sorting, and the indicated representations and algorithms. The student will ... establishing algorithmic correctness and estimating time and space ...