# Course Description

This course presents an introduction to the techniques for
designing efficient computer algorithms and analyzing their
running times. General topics include asymptotics, solving
summations and recurrences, algorithm design techniques,
analysis of data structures, and introduction to
NP-completeness.

# General Information

## Instructor

- Clyde Kruskal (kruskal@cs)

## Class Time / Venue

- Section 0101: TuTh 12:30–1:45, CSI 1115
- Section 0201: MWF 10:00–10:50, CSI 3117

## Piazza

- We will be using piazza for announcements and discussions. Please register yourself on Piazza. You can ask private questions (only instructor and TAs can see) or ask/reply anonymously. However DO NOT post your answer and ask if it is correct. If in doubt, ask private question or come during office hours.

## Midterm

~~Oct 29 (Monday) 6:30-8:30pm at ARM 0126 (0101) and ARM 0131 (0201).~~Nov 5 (Monday) 6:30-8:30pm at BRB 1101 (0101 and 0201). Practice midterm and information sheet given at midterm.

## Final

- Dec 15 (Saturday) 4:00-6:00pm at BRB 1101 (0101 and 0201). Practice final

## Textbook

- Cormen, Thomas H.; Leiserson, Charles E.; Rivest,
Ronald L.; Stein, Clifford (2009).
*Introduction to Algorithms*(3rd ed.). MIT Press (Any edition is fine)

## Teaching Assistant

- Melika Abolhassani (melika@cs)
- Yuk Hei Chan (Tom) (yhchan@cs)
- Deonna Hodges
- Emily Jones

## Office Hour (AVW 1112)

Monday | Tuesday | Wednesday | Thursday | Friday | |
---|---|---|---|---|---|

9:00-10:00 | Tom | ||||

10:00-10:50 | 0201 Class | 0201 Class | 0201 Class | ||

12:30-1:45 | 0101 Class | 0101 Class | |||

2:00-3:00 | Melika | Emily | |||

3:00-4:00 | |||||

4:00-5:00 | Tom | ||||

5:00-6:00 |