The course explores introductory concepts, algorithms and examples from probability theory, combinatorial theory (combinatorics), graph theory and set theory including relations and functions in sets.
With regard to combinatorial theory, the course examines the techniques of enumeration (enumerative combinatorics), the concepts of combinations, and permutations with or without repetitions.
With regard to probability theory, the course examines the concepts of probability and conditional probability. For graph theory, the course explores concepts, definitions, properties and algorithms with emphasis on planar and connected graphs.
The course also offers descriptions of the relations determined by finite sets and interpretations of the functions and graphic representations defined by them.
- Ability to understand and apply an algorithm.
- Ability to calculate the probability so that they can take political decisions based on real facts
- Ability to reach useful conclusions using the results of the elections. (method of bounds)
- Ability to abstract complex relationships and find the solution with the help of graph theory.
- Ability to study social networks and analyze network effects on the formation of political views.
- Assignments, quizzes or exercises prepared during the semester according to the procedures defined in the course (eg submission deadlines, assessment methods, etc.).
- Oral exams with emphasis on the assignments that have been prepared during the semester according to the procedures defined in the course
- Written exams The weight of the individual assessments is shaped by the special circumstances of each academic year and it is announced in the elearning of the course.