## Introduction

The topics that we will be discuss in this course fall into two main categories.
First, we will look at techniques that we can use to design efficient data structures
and algorithms. Second, we will learn tools that make it possible to prove the
correctness and the efficiency of the algorithms and data structures that we designed.
More specifically, we will look at the following broad topics (not necessarily in this
order):

- Searching and sorting;
- Data structures, such as skip lists.
- Mathematical tools, like
*O* notation, recurrence relations, and
amortized analysis;
- Algorithm design techniques, for instance randomization, greediness and
dynamic programming.

Much of the material is formal (mathematical) in nature, and hence proofs will
constitute an important part of the course.

At the end of the course, you will be able to:

- Recognize which algorithm design technique(s), such as divide and conquer,
prune and search, greedy strategies, or dynamic programming was used in a given
algorithm.
- Select and judge several promising paradigms and/or data structures
(possibly slightly modified) for a given problem by analyzing the problem's
properties.
- Implement a solution to a problem using a specified algorithm design
paradigm, given sufficient information about the form of that problem's
solution.
- Select, judge and apply promising mathematical techniques (such as
asymptotic notations, recurrence relations, amortized analysis and decision trees)
to establish reasonably tight upper and lower bounds on the running time of
algorithms.
- Recognize similarities between a new problem and some of the problems they
have encountered, and judge whether or not these similarities can be leveraged
towards designing an algorithm for the new problem.

## Prerequisites

The prerequisites for this course are:

- Either ((a) CPSC 221 OR (b) all of CPSC 260 and EECE 320) AND
- either ((c) 6 credits of 2nd Yr. MATH or STAT OR (d) 3 credits of 2nd Yr. MATH or STAT with a grade of 72% or better).