Course Information
Code | CSC3120 |
Name | Algorithm Design and Analysis |
Credit(s) | 3 |
Prerequisites | CSC241 - Datastructures |
Offered | Every Odd Numbered Spring |
Catalog Description | A study of algorithms and their complexity, including sorting, searching, pattern matching, combinatorics, backtracking, dynamic programming, and approximations and heuristics for NP-complete problems. |
Syllabus | Spring 2019 Syllabus |
Other Offerings | Algorithms/offerings |
Stuff
- A cleaner proof of the master method: mm-proof
Homework
- Homework 1 Due January 15, 2019
- Homework 2 Due January 24, 2019
- Problems 3-1 -- 3-4 on pages 61-62.
- Homework 3 Due 13 baktun 0 katun 6 tun 3 uinal 12 k'in
- Exercises 4.1-1, 4.1-2, 4.1-5 on pages 74-75
- Problems 4-1, 4-2, 4-5 Due a week after Next Tuesday
- Problems 15-4 and 15-5 pp 405-408 Due 3/7/2019
- Homework 6 Due April 2, 2019
- Problem 16-2 on page 447
- Problem 16-5 on Page 449
- 22-1 on Page 621
- Homework 7 Due April 23, 2019
- Problems 34-1 thru 34-4 on pages 1101 - 1104