Discrete mathematics

1.Course titleDiscrete mathematics
2.CodeF23L2S011
3.Study programme
4.Organizer of the study programme (unit, institute, department)Faculty of Computer Science and Engineering
5.Degree level (first, second, third cycle)First cycle
6.Academic year / semester2 / Summer
7.Number of ECTS credits6
8.Teacher
9.Prerequisites for enrolling in the course—
10.Course objectives (competences)The course is an introduction to the basic mathematical concepts necessary for advanced courses in information technology, computer and software engineering.
11.Course contentLectures:
1. Statements, statement operations, statement formulas and logical laws
2. Statement functions, predicate calculation, translation of sentences into statement formulas and functions.
3. Methods of inference and application
4. Methods of proof
5. Multitudes
6. Functions
7. Relations, ordering and equivalence
8. Graphs: presentation and properties (connectivity, Euler and Hamilton path, shortest path).
9. Isomorphism, coloring and planarity of graphs.
Trees: Basic terms in trees and tree roots
10. Application of Root Trees and Searching in Root Trees
Skeleton trees (lightest trees and search trees)
11. Combinatorics (permutations and combinations with and without repetition). binomial formula
12. Principle of inclusion and exclusion, iterations and recursion
12.Learning methodsLectures using presentations, interactive lectures, exercises (using equipment and software packages), teamwork, case studies, guest lecturers, independent preparation and defense of a project assignment and a seminar paper.
13.Total available time6 ECTS x 30 hours = 180 hours
14.Distribution of the available time45 + 45 + 0 + 0 + 90 = 180 hours
15.Forms of teaching activities
15.1.Lectures – theoretical teaching45 hours
15.2.Exercises (laboratory, auditory), seminars, team work45 hours
16.Other forms of activities
16.1.Project assignments0 hours
16.2.Individual assignments0 hours
16.3.Home study90 hours
17.Grading
17.1.Tests0 points
17.2.Seminar paper / project (presentation: written and oral)0 points
17.3.Activity and participation0 points
17.4.Final exam100 points
18.Grading criteria (points / grade)
up to 50 points5 (five) (F)
from 51 to 60 points6 (six) (E)
from 61 to 70 points7 (seven) (D)
from 71 to 80 points8 (eight) (C)
from 81 to 90 points9 (nine) (B)
from 91 to 100 points10 (ten) (A)
19.Requirements for signature and taking the final examActivities 15.2 and 16.1 have been completed.
20.Language of instructionMacedonian and English
21.Method of monitoring teaching qualityinternal evaluation and survey mechanism
22.Literature
22.1.Required literature
1. Kenneth H. Rosen | DISCRETE MATHEMATICS AND ITS APPLICATIONS, SIXTH EDITION International Edition, ISBN-13: 978-007- 124474-9 | he McGraw-Hill Companies | 2007
2. Rowan Garnier and John Taylor | Discrete Мathematics for New Technology Second Edition, ISBN 0 7503 0652 1 | OP Publishing Ltd | 2002
22.2.Additional literature
No. Author Title Publisher Year