DISCRETE MATHEMATICS
| Title | ΔΙΑΚΡΙΤΑ ΜΑΘΗΜΑΤΙΚΑ / DISCRETE MATHEMATICS |
| Code | NCO-01-04 |
| Faculty | Sciences |
| School | Informatics |
| Cycle / Level | 1st / Undergraduate |
| Teaching Period | Winter |
| Coordinator | John Paparrizos |
| Common | No |
| Status | Active |
| Course ID | 40002911 |
Programme of Study: PPS-Tmīma Plīroforikīs (2019-sīmera)
Registered students: 457
| Orientation | Attendance Type | Semester | Year | ECTS |
|---|---|---|---|---|
| GENIKĪ KATEUTHYNSĪ | Compulsory Course | 1 | 1 | 7 |
| Academic Year | 2018 – 2019 |
| Class Period | Winter |
| Faculty Instructors |
|
| Weekly Hours | 5 |
| Class ID | 600121189
|
Class Schedule
| Building | Σχ. Θετικών Επιστημών - νέο κτίριο - Ανατολ. πτέρυγα |
| Floor | Ισόγειο |
| Hall | "ΕΜΠΕΙΡΙΚΟΣ ΝΙΚΟΛΑΟΣ" (193) |
| Calendar | Δευτέρα 10:00 έως 13:00 |
| Building | Σχ. Θετικών Επιστημών - νέο κτίριο - Ανατολ. πτέρυγα |
| Floor | Όροφος 1 |
| Hall | ΑΙΘΟΥΣΑ Δ31 (194) |
| Calendar | Τετάρτη 14:00 έως 16:00 |
Course Type 2016-2020
- Background
Course Type 2011-2015
General Foundation
Mode of Delivery
- Face to face
Digital Course Content
- e-Study Guide https://qa.auth.gr/en/class/1/600121189
- At the Website of the School: delab.csd.auth.gr/~tsichlas/discrete.html
Language of Instruction
- Greek (Instruction, Examination)
- English (Examination)
Learning Outcomes
he goal is the introduction to fundamental notions and techniques of discrete mathematics, which constitute the basis for almost all theoretical courses, with applications ranging from network design to databases. In this sense, students acquire fundamental mathematical tools in Computer Science.
General Competences
- Apply knowledge in practice
- Adapt to new situations
- Work autonomously
- Advance free, creative and causative thinking
Course Content (Syllabus)
Basic elements of Propositional and Predicate Logic, Proof Techniques, Number Systems - Basic Elements of Number Theory, Sets, Functions - Relations, Recurrences, Sums and Asymptotic Notation, Basic Elements of Counting - Combinations and Permutations of Objects, Discrete Probability, Graphs and Trees.
Keywords
Propositional Logic, Predicate Logic, Combinatorics, Relations, Probability, Graphs
Educational Material Types
- Notes
- Slide presentations
- Book
Use of Information and Communication Technologies
Use of ICT
- Use of ICT in Course Teaching
Course Organization
| Activities | Workload | ECTS | Individual | Teamwork | Erasmus |
|---|---|---|---|---|---|
| Lectures | 39 | ✓ | |||
| Reading Assigment | 72 | ✓ | |||
| Tutorial | 26 | ✓ | |||
| Written assigments | 70 | ✓ | ✓ | ||
| Exams | 3 | ✓ | |||
| Total | 210 |
Student Assessment
Description
Written exams on the covered material with emphasis on topics taught after the mid-term exams (book, lecture notes, presentations, exercises) (50-60% of the final grade). A mid-term exam on topics that have been covered until this point (20-30% of the final grade). Comprehension exercises every two weeks (20-30% of the final grade).
Student Assessment methods
- Written Exam with Multiple Choice Questions (Summative)
- Written Exam with Short Answer Questions (Summative)
- Written Exam with Problem Solving (Formative, Summative)
- Mid-term exams (Summative)
Bibliography
Course Bibliography (Eudoxus)
1. Ε.Σ. Αγγελής και Γ.Λ. Μπλέρης. Διακριτά Μαθηματικά. Εκδόσεις Τζιόλα. 2003.
2. K.H. Rosen. Διακριτά Μαθηματικά και Εφαρμογές τους. 5η Έκδοση, Εκδόσεις Τζιόλα, 2009.
Additional bibliography for study
1. D.E. Ensley και J.W. Crawley. Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns and Games. Wiley, 2006.
2. R.L. Graham, D.E. Knuth και O. Patashnik. Concrete Mathematics. Addison-Wesley, 1988.
Last Update
15-06-2016
