MA 51800, Fall 2017

Course Description

Credit Hours: 3.00. The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations, evaluation of sums, integer functions, elementary number theory, binomial coefficients, generating functions, discrete probability, and asymptotic methods. Typically offered Spring.

Instructor Info.

Section Room Time Instructor Office
MA 51800 001 UNIV 117 12:00pm TR Arapura, Donu MATH 642

Course Materials

Section Type Title Author
ALL Textbook Concrete Mathematics: A Foundation for Computer Science (2nd Edition) (2) Ronald L. Graham

Important Notes

  • ADA policies: please see our ADA Information page for more details
  • In the event of a missed exam, see your instructor/professor as soon as possible.
  • See the online course evaluation page for more information on how we collect course feedback from students