# Course Information

Check back closer to the beginning of the fall semester for more information!

Check back closer to the beginning of the fall semester for more information!

All other files will be stored on Moodle for this class. You will receive instructions on how to access Moodle during the first class period.

- Wednesday, August 23: First day of class
- Wednesday, August 30: Add/drop deadline
- Monday, September 4: Labor Day (no class)
- Friday, October 6: No class (Professor out of town)
- Friday, October 13: Mid-semester break (no class)
- Friday, November 17: Last day to withdraw
- Wednesday, November 22 and Friday, November 24: Thanksgiving Break (no class)
- Friday, December 8: Last day of class
- Week of December 11th: Final Exam (date and time TBD)

Introductory course surveying a variety of algorithm designs. Sorting algorithms, graph and tree algorithms, and asymptotic analysis of algorithm efficiency will be covered. Additional algorithm topics will be covered on a rotating basis, including matrix operation algorithms, combinatorial algorithms, cryptography algorithms, and computational complexity. No previous exposure to computer programming will be assumed. 3 credits.

**Prerequisites:** None.

**Required Textbook: ** *The Algorithm Design Manual*, 2nd edition, by Skiena.

If you have a weighted average of at least... | You will earn a(n): |
---|---|

93% | A |

88% | B+ |

82% | B |

77% | C+ |

70% | C |

65% | D+ |

60% | D |