| 1. | Course Title | Discrete Мathematics | |||||||||||
| 2. | Code | 4ФЕИТ08004 | |||||||||||
| 3. | Study program | 3-EES, 7-NKS,13-PMA | |||||||||||
| 4. | Organizer of the study program (unit, institute, department) | Faculty of Electrical Engineering and Information Technologies | |||||||||||
| 5. | Degree (first, second, third cycle) | Second cycle | |||||||||||
| 6. | Academic year/semester | I/1 | 7. | Number of ECTS credits | 6.00 | ||||||||
| 8. | Lecturer | Dr Vesna Andova | |||||||||||
| 9. | Course Prerequisites | ||||||||||||
| 10. | Course Goals (acquired competencies):
The ability to define, understand and solve creative professional challenges of applied mathematics. The ability of professional communication in the native language as well as in English. Most of the course is devoted to graph theory emphasizing graph algorithms. In part, the course covers problems in discrete optimization. |
||||||||||||
| 11. | Course Syllabus:
Elements of combinatorics. Linear recursions and generating functions. Graph theory. Graph representations. Connectivity, coverings, and blocks. Weighted graphs. Minimal spanning tree. Graph algorithms. Flow. |
||||||||||||
| 12. | Learning methods:
Lectures, exercises, individual work, ans homework assignments. |
||||||||||||
| 13. | Total number of course hours | 180 | |||||||||||
| 14. | Distribution of course hours | 3 + 3 | |||||||||||
| 15. | Forms of teaching | 15.1 | Lectures-theoretical teaching | 45 hours | |||||||||
| 15.2 | Exercises (laboratory, practice classes), seminars, teamwork | 45 hours | |||||||||||
| 16. | Other course activities | 16.1 | Projects, seminar papers | 30 hours | |||||||||
| 16.2 | Individual tasks | 30 hours | |||||||||||
| 16.3 | Homework and self-learning | 30 hours | |||||||||||
| 17. | Grading | ||||||||||||
| 17.1 | Exams | 30 points | |||||||||||
| 17.2 | Seminar work/project (presentation: written and oral) | 30 points | |||||||||||
| 17.3. | Activity and participation | 0 points | |||||||||||
| 17.4. | Final exam | 40 points | |||||||||||
| 18. | Grading criteria (points) | up to 50 points | 5 (five) (F) | ||||||||||
| from 51 to 60 points | 6 (six) (E) | ||||||||||||
| from 61 to 70 points | 7 (seven) (D) | ||||||||||||
| from 71 to 80 points | 8 (eight) (C) | ||||||||||||
| from 81 to 90 points | 9 (nine) (B) | ||||||||||||
| from 91 to 100 points | 10 (ten) (A) | ||||||||||||
| 19. | Conditions for acquiring teacher’s signature and for taking final exam | ||||||||||||
| 20. | Forms of assessment |
The assessment will be done continuously by midterm exams, homework/project and final exam. If a student does not take the midterm exams, he/she has to take written problem exam. |
|||||||||||
| 21. | Language | Macedonian and English | |||||||||||
| 22. | Method of monitoring of teaching quality | ||||||||||||
| 23. | Literature | ||||||||||||
| 23.1. | Required Literature | ||||||||||||
| No. | Author | Title | Publisher | Year | |||||||||
| 1. | A. Bondy, U.S.R. Murty | Graph Theory | Springer | 2008 | |||||||||
| 2. | J.H.van Lint, M.S. Wilson | A course in combinatorics | Cambridge Univ. Press | 2001 | |||||||||
| 3. | G.Appa, L.Pitsoulis, H.P.Williams | HANDBOOK ON MODELLING FOR DISCRETE OPTIMIZATION | Springer | 2006 | |||||||||
