Akademik Dersler - İçerik

Explains the basic concepts of discrete mathematics related to computer science.
Explains the concepts of propositional logic, predicate logic, induction and recursion and relations.
Explains the computational structures such as trees, graphs, finite state machines and Turing machines.
Expresses the usage and aim of each concept learned in other computer engineering courses.
Explains the formal definitions of some discrete computational structures.
Expresses the formal definitions of recursive and non-recursive algorithms.
Gives the formal definitions of discrete computational structures such as finite state machines and Turing machines.
Realizes the applications of discrete mathematics.
Demonstrates the proof of some benchmark theorems by induction.
Illustrates recursive algorithms of some known sequences.
Designs finite state machines for pattern recognition
Designs some functions of natural numbers byTuring machines.