Math 131. Discrete Structures in Computer Science I |
||||
|
Ana sayfa / Home Öğrenci
Semineri / Students' Seminar Takvim /
Calendar 2003-2004 |
Counting methods and the pigeonhole principle. Difference equations. Probability. Propositional logic. Set theory: equivalence relations, partial and total orders, (finite or infinite) unions and intersections. Boolean algebras. Algorithmic linear algebra. Selected topics. Credits: 3 Instructors: Haluk Oral (2003-2004) Fall
2004 Final exam and its correction Fall 2005 Page (new!) |
|||