# CMSC 351 - Algorithms

### Course Description

A systematic study of the complexity of some elementary algorithms related to sorting, graphs and trees, and combinatorics. Algorithms are analyzed using mathematical techniques to solve recurrences and summations.

### General Information

- Class Time/Location
- The class meets
*every* weekday, 11:00am-12:20pm in CSI 1122
- Instructor
- Clyde Kruskal
- Office Hours
- Monday, Thursday 9:30-11:00am; AVW 3215
- Teaching Assistant
- MohammadReza Ghodsi
- Office Hours
- Tuesday, Thursday 12:30-2:00pm/2:30pm; AVW 1112
- Textbook
- Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms, second edition, MIT Press and McGraw-Hill

### Syllabus

ps pdf

### Homeworks

*Homeworks are due at the start of class.*

- Homework 0 ps pdf
- Homework 1 ps pdf (Due Friday June 8)
- Homework 2 ps pdf (Due Wednesday June 13)
- Homework 3 ps pdf (Due Friday June 15)
- Homework 4 ps pdf (Due Wednesday June 20)
- Homework 5 (Due Friday June 22)
- Homework 6 ps pdf (Due Wednesday June 27)
- Homework 7 ps pdf (Due Wednesday July 11)
- Homework 8 ps pdf (Due Friday July 13)

### Exams

- The midterm exam will be on Tuesday July 3rd in class
- Practice questions for the final exam: ps pdf