Deutsch Pусский العربية فارسی Türkçe
Skip To Content Site Search Deutsch Pусский العربية فارسی Türkçe
Eastern Mediterranean University

Discrete Mathematics (MATH163)

Set theory, functions and relations; introduction to set theory, functions and relations, inductive proofs and recursive definitions. Combinatorics; basic counting rules, permutations, combinations, allocation problems, selection problems, the pigeonhole principle, the principle of inclusion and exclusion. Generating functions; ordinary generating functions and their applications. Recurrence relations; homogeneous recurrence relations, inhomogeneous recurrence relations, recurrence relations and generating functions, analysis of algorithms. Propositional calculus and boolean algebra; basic boolean functions, digital logic gates, minterm and maxterm expansions, the basic theorems of boolean algebra, simplifying boolean function with karnaugh maps. Graphs and trees; adjacency matrices, incidence matrices, eulerian graphs, hamiltonian graphs, colored graphs, planar graphs, spanning trees, minimal spanning trees, Prim's algorithm, shortest path problems, Dijkstra's algorithms .

Credit: 3

Lecture Hour (hrs/week): 3

Lab (hrs/week): 1

Tutorial (hrs/week): 1

Related Programs