## Course Description

The development of provably-correct algorithms to solve problems and their analyses. Topics include basic algorithm design techniques such as greedy, divide-and-conquer, and dynamic programming, and network flows. Intractability and NP-completeness.

See the course outline for more information.

## Course Details

### Lecture Time/Place

Monday, 12:15pm–1:05pm; Wednesday, 11:15am–12:05pm; Thursday, 1:15pm–2:05pm

All lectures are held in Mulroney Hall, room 3022.

### Textbook

J. Kleinberg and É. Tardos, *Algorithm Design*. Pearson Addison-Wesley, 2005.

The textbook is available for sale at the campus bookstore. Course notes will also be provided for each lecture.

### Marking Scheme

- Four assignments (12.5% each, total 50%)
- Midterm examination (25%)
- Final examination (25%)

You must write the final examination in order to pass the course, even if the weighted sum of your assignment and midterm examination grades is at least 50%.

## News

- Feb. 3: Lecture slides for the fifth week have been posted.
- Feb. 2: The midterm will be written next week during the Feb. 9 lecture. See the review document and the Exams section below for more details. A practice midterm is also available.
- Jan. 30: The second assignment has been posted. It is due by Feb. 16 at 1:15pm.
- Jan. 27: Lecture slides for the fourth week have been posted.
- Jan. 20: Lecture slides for the third week have been posted.
- Jan. 16: Due to the delayed opening of the university, the lecture today is cancelled.
- Jan. 13: Lecture slides for the second week have been posted.
- Jan. 9: The first assignment has been posted. It is due by Jan. 26 at 1:15pm.
- Jan. 6: Lecture slides for the first week have been posted.
- Jan. 4: Welcome to the course! Please see our Moodle page for details about the course this term.

## Lectures

Week |
Notes |
Readings |

1 | Introduction: stable matching, representative problems | Kleinberg & Tardos, 1.1–1.2 |

2 | Algorithm analysis | Kleinberg & Tardos, 2.1–2.2, 2.4 |

3 | Graphs | Kleinberg & Tardos, 3.1–3.2, 3.4–3.6 |

4 | Greedy algorithms: coin changing, scheduling, partitioning | Kleinberg & Tardos, 4.1–4.2 |

5 | Greedy algorithms (cont’d): Dijkstra, MSTs (Prim, Kruskal, Borůvka) | Kleinberg & Tardos, 4.4–4.6 |

6 | Mid-course review, midterm examination | – |

**Credit.** Lecture slide sources courtesy of Kevin Wayne.

## Assignments

- Assignment 1, due Jan. 26
- Assignment 2, due Feb. 16
- Assignment 3, due Mar. 16
- Assignment 4, due Apr. 3

Assignments are due at the beginning of class on the due date. Late assignments will be accepted up to the beginning of the first class following the due date. Late assignments are subject to a penalty of 10% deducted from the earned mark.

## Exams

### Midterm

Date: Feb. 9, 2022

Time: 1:15pm–2:05pm

Place: Mulroney Hall, room 3022

Content: All material from Weeks 1 to 5

## Personnel

### Instructor

Taylor J. Smith

Email: tjsmith [at] stfx [dot] ca

Office: Annex, Room 9A

Student hours: Thursday, 9:15am–11:15am