MA 51800, Spring 2010
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.
|MA 51800 001||REC 108||2:30pm||MWF||Lempert, Laszlo||MATH 728|
There are no materials for this course.