CmpE 220 Discrete Computational Structures
Propositional Logic and Proofs. Set Theory. Relations and Functions.
Algebraic Structures. Groups and Semi-Groups. Graphs, Lattices, and
Boolean Algebra. Algorithms and Turing Machines.
K. H. Rosen (1999) Discrete Mathematics and Its Applications 4th (or later) Edition, McGraw-Hill. (Available at BU Bookstore).
Dr Ethem Alpaydin, Professor. Department of Computer Engineering,
Bogazici University alpaydin AT boun.edu.tr
Itir Barutcuoglu, TA.
See the Course Web Page for homeworks, grades, etc.
A course in discrete mathematics should teach students how to work with
discrete (meaning consisting of distinct or unconnected elements as
opposed to continuous) structures used to represent discrete objects and
relationships between these objects. These discrete structures include
sets, relations, graphs, trees, and finite-state machines.
Sophomore standing in CmpE.
Logic, Sets, and Functions
Methods of Proof
Introduction to Languages and Grammars
- 2 Mid-terms 2*20%
- Final 40%
- Exercises 20%