Lecture
MTH 286
4 credits
Mathematics at
|
| Prerequisite is MTH 174 or
equivalent. Presents topics in discrete mathematical structures which
are basic tools used in computer science. Covers sets, Boolean algebra,
counting methods, generating functions and recurrence relations, graph
theory, trees, and an introduction to finite state automata. Designed
for mathematical, physical, and engineering science programs. Lecture 4
hours per week. |
For description of the course content click here
Required sections in the current textbook:
Discrete Mathematical Structures, fifth edition, by Kolman, Busby, Ross
1.1, 1.2,
1.5, 1.6
2.1-2.4
3.1-3.3, 3.5
4.1-4.7
5.1-5.3
8.1-8.3
7.1-7.5
10.3
Optional: 8.4, Chapter 11, More of Chapter 10
Kevin Chouinard: Fall 2004 twice a week
