MATH-110 Discrete Mathematics
Prof. Ergün Yalçın
2013-2014- Spring
Sets and propositions: Finite and infinite sets, mathematical induction, propositions. Permutations, combinations, and discrete probability. Relations and functions: binary, equivalence relations, partitions, partial ordering, functions. Graphs: weighted graphs, paths and circuits, shortest paths. Eulerian and Hamiltonian paths. Trees. Abstract algebra: groups, cosets, Lagrange's theorem, Boolean algebra.
![]() | Lecture 36 (2014-05-13) Generating functions | |
![]() | Lecture 35 (2014-05-09) Recurrence relations: Complex roots | |
![]() | Lecture 34 (2014-05-09) Recurrence relations: Repeated roots | |
![]() | Lecture 33 (2014-05-06) Recurrence relations | |
![]() | Lecture 32 (2014-04-25) Review and problem solving for Midterm 2 | |
![]() | Lecture 31 (2014-04-25) Planar Graphs | |
![]() | Lecture 30 (2014-04-22) Euler Circuits | |
![]() | Lecture 29 (2014-04-18) Turans Theorem | |
![]() | Lecture 28 (2014-04-18) Estimations for maximum clique size | |
![]() | Lecture 27 (2014-04-15) Cliques and independent sets | |
![]() | Lecture 26 (2014-04-11) Prims Algorithm | |
![]() | Lecture 25 (2014-04-11) Greedy Algorithm | |
![]() | Lecture 24 (2014-04-08) The minimum spanning tree problem | |
![]() | Lecture 23 (2014-04-04) Trees | |
![]() | Lecture 22 (2014-04-01) Connected graphs, Graph isomorphism | |
![]() | Lecture 21 (2014-03-28) Basic definitions in graph theory | |
![]() | Lecture 20 (2014-03-28) Introduction to graph theory | |
![]() | Lecture 19 (2014-03-25) Pigeonhole principle | |
![]() | Lecture 18 (2014-03-18) Review for Midterm I | |
![]() | Lecture 17 (2014-03-14) Sterling numbers of the second type | |
![]() | Lecture 16 (2014-03-14) Inclusion-exclusion principle | |
![]() | Lecture 15 (2014-03-11) Binomial Theorem for Negative Powers | |
![]() | Lecture 14 (2014-03-07) Repeated Combinations | |
![]() | Lecture 13 (2014-03-07) Properties of Pascal Triangle | |
![]() | Lecture 12 (2014-03-04) Binomial Theorem | |
![]() | Lecture 11 (2014-02-28) Combinations | |
![]() | Lecture 10 (2014-02-28) Permutations | |
![]() | Lecture 9 (2014-02-25) Sum and Product Rules for counting | |
![]() | Lecture 8 (2014-02-21) Prime numbers | |
![]() | Lecture 7 (2014-02-21) Greatest common divisors and linear combination of integers | |
![]() | Lecture 6 (2014-02-18) | |
![]() | Lecture 5 (2014-02-14) Greatest common divisors | |
![]() | Lecture 4 (2014-02-14) Strong mathematical induction | |
![]() | Lecture 3 (2014-02-11) Mathematical Induction | |
![]() | Lecture 2 (2014-02-07) Set theory notation | |
![]() | Lecture 1 (2014-02-07) Course details and Introduction |