Course Information

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

Important Files and Links

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.

Important Dates for Fall 2017

Course Description

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.

Resources

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

Grading Information

If you have a weighted average of at least... You will earn a(n):
90% A
87% B+
80% B
77% C+
70% C
60% D