Course Descriptions

The Course Descriptions catalog describes all undergraduate and graduate courses offered by Michigan State University. The searches below only return course versions Fall 2000 and forward. Please refer to the Archived Course Descriptions for additional information.

Course Numbers Policy
Definitions of Course Characteristics (pdf)

Course Search




Keyword Search



Course Descriptions: Search Results

MTH 481  Discrete Mathematics I

Description:
Binomial and multinomial theorems. Graphs and digraphs, graph coloring. Generating functions, asymptotic analysis, trees. Representing graphs in computers.
Effective Dates:
FS92 - US99


MTH 481  Discrete Mathematics I

Description:
Binomial and multinomial theorems. Graphs and digraphs, graph coloring. Generating functions, asymptotic analysis, trees. Representing graphs in computers.
Effective Dates:
FS99 - SS02


MTH 481  Discrete Mathematics I

Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 3   Lecture/Recitation/Discussion Hours: 3
Prerequisite:
MTH 309
Description:
Binomial and multinomial theorems. Graphs and digraphs, graph coloring. Generating functions, asymptotic analysis, trees. Representing graphs in computers.
Effective Dates:
US02 - US13


MTH 481  Discrete Mathematics I

Semester:
Fall of every year, Spring of every year
Credits:
Total Credits: 3   Lecture/Recitation/Discussion Hours: 3
Prerequisite:
MTH 309
Description:
Binomial and multinomial theorems. Graphs and digraphs, graph coloring. Generating functions, asymptotic analysis, trees. Representing graphs in computers.
Effective Dates:
FS13 - US24


MTH 481  Discrete Mathematics I

Semester:
Fall of every year, Spring of every year, Summer of every year
Credits:
Total Credits: 3   Lecture/Recitation/Discussion Hours: 3
Prerequisite:
MTH 309
Description:
Binomial and multinomial theorems. Graphs and digraphs, graph coloring. Generating functions, asymptotic analysis, trees. Representing graphs in computers.
Effective Dates:
FS24 - Open