Discrete Mathematics I
| Course Code | 321-1500 |
|---|---|
| Semester | 1 |
| ECTS | 5.00 |
| Hours (Theory) | 3 |
| Hours (Lab) | 2 |
| Instructor | Leros Asimakis |
Course Content
Logic: compound statements, conditional statements, predicates, quantifiers, methods of proof. Elementary number theory: divisibility, prime numbers, parity. Elementary set theory: operations, identities, cardinality, inclusion-exclusion principle. Mathematical induction. Combinatorial analysis: multiplication rule, permutations, orderings, combinations, the pidgeonhole principle, binomial coefficients. Binary relations, functions, equivalence relations, partial ordering relations.
Learning Outcomes
The aim of this course is a first exposure to the theoretical framework of Computer Science. Upon completion of the course, students will have the ability
- to follow a basic proof;
- to state problems in formal language;
- to use basic proof techniques in elementary problems.
Prerequisites
Not required.
Teaching and Learning Methods
| Activity | Semester workload |
|---|---|
| Lectures | 39 hours |
| Review-Problem Session hours | 26 hours |
| Personal study | 56 hours |
| Exam | 1 hour |
| Final exams | 3 hours |
| Course total | 125 hours (5 ECTS) |
Assessment Methods / Grading
- Small quizzes in class
- Final exam
Teaching Language
Greek (English for Erasmus students)