MATH 210 Finite and Discrete Mathematics
|
Sets and propositions. Mathematical induction. Recurrence relations. Graph theory: trees, Euler paths, planar graphs, graph isomorphism. Enumerative combinatorics: binomial coefficients, pigeonhole principle, relations and incidence matrices, functions, isomorphism of posets, Hasse diagrams, equivalence relations, Stirling numbers of the second kind.
Credit units: 3 ECTS Credit units: 5.
Spring Semester (Müfit Sezer)
|
|
|
Bilkent University Main Page
Last regenerated automatically on April 22, 2024 by OAC - Online Academic Catalog Software
|
|
