21-228 Discrete Mathematics

Units: 9.0 Department: Mathematical Sciences Prerequisites: 21-127 Related URLs: http://www.math.cmu.edu The techniques of discrete mathematics arise in every application of mathematics, which is not purely continuous, for example in computer science, economics, and general problems of optimization. This course introduces two of the fundamental areas of discrete mathematics: enumeration and graph theory. The introduction to enumeration includes permutations, combinations, and topics such as discrete probability, combinatorial distributions, recurrence relations, generating functions, Ramsey's Theorem, and the principle of inclusion and exclusion. The introduction to graph theory includes topics such as paths, walks, connectivity, Eulerian and Hamilton cycles, planar graphs, Euler's Theorem, graph coloring, matchings, networks, and trees. 3 hrs. lec, 1 hr. rec.

Popularity index Rank for this semester: #146 Rank in this department: #20   Students also scheduled 36-217 Probability Theory and Random Proce... 18-220 Fundamentals of Electrical Engineer... 21-241 Matrix Algebra 18-202 Mathematical Foundations of Electri... 15-200 Advanced Programming/Practicum 21-259 Calculus in Three Dimensions 21-292 Operations Research I 21-126 Introduction to Mathematical Softwa... 21-270 Introduction to Mathematical Financ... 03-240 Cell Biology

Spring 2005 times

Sec	Time	Day	Instructor	Location
1	3:30 - 4:20 pm	M	Pikhurko	PH 100
		W	Pikhurko	PH 100
		F	Pikhurko	PH 100
A	1:30 - 2:20 pm	T	Instructor TBA	DH 2105
B	2:30 - 3:20 pm	T	Instructor TBA	DH 2105