Discrete Mathematics
1. Set Theory: Set, subset, reference set, Venn diagram, set equality, foreign sets, set partitioning, set operations – operations properties, powerset, multisets, operations on multisets, mathematical induction.
2. Relations: Basic concepts-operations of binary operations and operations properties. Special binary operations, partial orders and equivalence relations. Functions, types of functions, properties of functions.
3. Mathematical Logic: Propositional Logic – logical operators, sufficient operators’ sets, tautology, contradiction, mathematical proof, text conversion to mathematical representation and vice versa. Introduction to Predicate Logic – propositional functions, existential and universal quantifiers.
4. Algorithms: Complexity of algorithms (Big-O, Big-Ω, Big-Θ), recursive algorithms
5. Graph Theory: Non-directional, directional graphs, properties and types of graphs, Euler and Hamilton paths, spanning trees.
6. Mathematical Models of Computing Machines: Languages and grammars, finite state machines, automata, Turing machines.
Instructors
| Name | Title | |
|---|---|---|
| Thomas Lagkas | Assistant Professor | tlagkas@cs.duth.gr |