MA 51800, Spring 2006
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 518 0101 | 7:00pm | Heinzer, William | MATH 636 | ||
Course Materials
There are no materials for this course.
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