Discrete Mathematics

Discrete Mathematics

Code:
Semester:
Type:
Direction:

P1-1050
1st
Compulsory

Course hours:
Instructors:

Links:

2 Lec – 2 T
Grammati Pantziou (Faculty)Konstantinos Barlas (Laboratory Technical Staff)

Description

The goal of this course is to introduce students to ideas and techniques from discrete mathematics that are widely used in computer science and engineering. The students will learn how to work with discrete structures i.e., the abstract mathematical structures used to represent discrete objects and relationships between these objects. Also, they will learn and understand mathematical reasoning in order to be able to comprehend and construct mathematical arguments.

Course content: Propositional Logic; Predicates and Quantifiers; Sets, Relations and Functions; Equivalence Relations and Partitions; Countable and Uncountable Sets; Diagonalization Principle; Mathematical Induction; Discrete Numeric Functions; Recurrence Relations; Introduction to Combinatorics; The Principle of Inclusion-Exclusion; Introduction to Graph Theory (graph representation, Euler and Hamiltonian paths, connectivity, shortest paths, planar graphs and trees).