Преподавател(и):

проф. Красимир Манев  д-р

Описание на курса:

Компетенции:

Students successfully finished the course:

1) will know:

- basic notions and facts of set theory;

- basic notions and laws of Boolean algebra and their applications in computer systems;

- basic types of relations and functions, their properties and applications;

- basic notions and facts of counting.

2) will be able to solve tasks in the listed above domains.

Предварителни изисквания:
Elementary mathematics (school level).

Форми на провеждане:
Редовен

Учебни форми:
Лекция

Език, на който се води курса:
Български

Теми, които се разглеждат в курса:

№ Topic Form Hours

1. Sets. Boolean Algebra. Induction Lecture 2

2. Sets Exercises 2

3. Boolean Algebra Exercises 2

4. Induction Exercises 2

4. Relations & Function Lecture 2

5. Relations Exercises 2

6. Functions Exercises 2

7. Test 1 Test 2

8. Make-Up of Test 1 Exercises 2

9. Counting principles Lecture 2

10. Combinatorial configurations Lecture 2

11. Counting Exercises 2

12. Counting Exercises 2

13. Counting Exercises 2

14. Test 2 Test 2

15. Make-Up of Test 2 Exercises 2

Литература по темите:

1. Handouts in Moodle;

2. Any of the numerous text-books on Discrete mathematics could be helpful.

The next two books could be used by students that know Bulgarian:

3. Кр. Манев, Увод в дискретната математика, КЛМН, 5-тн издание.

4. В. Бакоев, Дискретна математика: множества, релации, комбинаторика, КЛМН, 2014.

Средства за оценяване:

1. Two written control works during the term;

2. Written final examination at the end of the term.

If the average mark from the two control works is at least 3.5, the student may be exempted from the final examination with a final mark equal to the mention average.

Transforming points from control works to grades (% from max score)

less than 50% - 2;

from 51% to 60% - 3;

from 61% to 67% - 3,5; from 68% to 74% - 4;

from 75% до 79% - 4,5; from 80% to 84% - 5;

from 85% до 89% - 5,5; more than 89% - 6.