Bogazici University Department of Computer Engineering C mpE 220 Discrete Mathematics Overview Fall 2005 Haluk Bingöl. About CmpE 220. CmpE 220 Discrete Computational Structures (3+0+0) 3 .
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Mathematics is, most generally, the study of any and allcertain truthsabout any and allwell-defined concepts.
(Orders of Growth)
(Automata)Discrete Structures We’ll Study
Compilers & interpreters.
Formal specification & verification
Error correction codes
Graphics & animation algorithms, game engines, etc.…
DM is relevant for all aspects of computing!Some Examples
Proof methods (§1.5)
Set theory (§1.6-7)
(Orders of Growth (§2.2))
Number theory (§2.4-5)
Number theory apps. (§2.6)
Proof strategy (§3.1)
Inductive Proofs (§3.3)
Program verification (§3.6)
Combinatorics (ch. 4)
Probability (ch. 5)
Relations (ch. 7)
Graph Theory (chs. 8+9)
Boolean Algebra (ch. 10)
(Computing Theory (ch.11))Course Outline (as per Rosen)