Code |
Course Name |
Language |
Type |
MUH 211 |
Discrete Mathematics |
Turkish |
Compulsory |
Local Credits |
ECTS |
Theoretical |
Tutorial |
Laboratory |
3 |
4.5 |
3 |
0 |
0 |
Course Prerequisites and Class Restriction |
Prerequisites |
None |
Class Restriction |
None |
Course Description |
Combinations, permutations, binomial theorem and applications, counting. Algorithms and their analysis, recursive algorithms.
Representations of integers, Euclid algorithm, RSA cryptosystem. Recurrence relations, their solutions, application to analysis of
algorithms. A basic introduction to graph theory. Boolean algebra, combinatorial circuits, finite state machines, finite state
automata and Turing Machine |
|