Subject

Discrete Structures 2

Course Title

Discrete Structures 2
Discrete Structures 2

Code

F23L2S032

Study Programme

Computer Science

Organizer of the study programme (unit, institute, department or division)

Faculty of Computer Science and Engineering

Degree level (first, second, third cycle)

First Cycle

Academic year / semester

2 / Summer

Number of ECTS credits

Teacher

Biljana Toytovska Ribarski, Marija Mihova, Natasha Ilievska

Prerequisites for enrolling in the course

—

10.

Objectives of the course programme (competences)

The course is an introduction to the fundamental mathematical concepts necessary for advanced computer science courses. Advanced techniques for proofs, induction, and recursion will be studied. Students should acquire skills in solving combinatorial problems and become familiar with basic terminology and the fundamentals of graph representation.

11.

Course content

Relations, ordinations. Equivalences. Induction and recursion. Counting. Basic combinatorics. Pigeonhole principle. Advanced combinatorial techniques. Binomial formula. Graphs (basic concepts, representations, and properties) Isomorphism, path planarity. Trees and their properties. Search trees

12.

Learning methods

Lectures 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 time

6 ECTS x 30 hours = 180 hours

14.

Distribution of available time

45 + 45 + 0 + 0 + 90 = 180 hours

15.

Forms of teaching activities

15.1.	Lectures - theoretical instruction	45 hours
15.2.	Exercises (laboratory, auditory), seminars, teamwork	45 hours

16.

Other forms of activities

16.1.	Project assignments	0 hours
16.2.	Independent assignments	0 hours
16.3.	Home study	90 hours

17.

Assessment method

17.1.	Tests	0 points
17.2.	Seminar paper / project (presentation: written and oral)	0 points
17.3.	Activities and learning	0 points
17.4.	Final exam	100 points

18.

Grading criteria (points / grade)

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.

Requirement for obtaining a signature and taking the final exam

Activities 15.2 and 16.1 have been completed.

20.

Language of instruction

Macedonian and English

21.

Method for monitoring the quality of teaching

internal 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 \| The McGraw-Hill Companies \| 2007 2. Rowan Garnier and John Taylor \| Discrete Mathematics for New Technology Second Edition, ISBN 0 7503 0652 1 \| IOP Publishing Ltd \| 2002
22.2.	Additional literature No. Author Title Publisher Year