University of Bialystok - Central Authentication SystemYou are not logged in | log in
course directory - help


General data

Course ID: 0600-MS1-1KOM#a Erasmus code / ISCED: 11.101 / (0541) Mathematics
Course title: Combinatorics Name in Polish: Combinatorics
Department: Faculty of Mathematics and Informatics
Course groups: (in Polish) 3L stac. I st. studia matematyki - przedmioty obowiązkowe
ECTS credit allocation (and other scores): 5.00
view allocation of credits
Language: English
Type of course:

obligatory courses


Elements of Logic and Set Theory 0600-MS1-1WDM#a
Mathematical Analysis I 0600-MS1-1AM1#a

Short description:

Course objectives:

Student will gain skills counting numbers of combinatorial objects of fundamental types defined on finite sets. He will also learn how to apply in practice generating functions and power series to solve recurrence equations.

Full description:

Course profile: academic

Form of study: stationary

Course type: obligatory

Academic discipline: Mathematics, field of study in the arts and science: mathematics

Year: 1, semester: 2

Prerequisities: Mathematical Analysis I, Elements of Logic and Set Theory

lecture 30 h. exercise class 30 h.

Verification methods: lectures, exercises, consultations, studying literature, home works, discussions in groups.

ECTS credits: 4

Balance of student workload:

attending lectures15x2h = 30h

attending exercise classes 7x4h + 2h(preliminary teaching) = 30h

preparation for classes 7x3h = 21h

completing notes after exercises and lectures 7x2h = 14h

consultations 5x2h = 10h

the final examination: preparation.and take 15h + 4h = 19h

Quantitative description

Direct interaction with the teacher: 74 h., 2 ECTS

Practical exercises: 75 h., 3 ECTS

Learning outcomes:

Learning outcomes:

Knows and can apply basic elementary counting techniques used for combinatorial objects.K_W01, K_W04, K_W05, K_W06, K_U09, K_U11, K_U29, K_K01

Can prove fundamental combinatorial equations.K_W01, K_W05, K_W06, K_U11, K_U29, K_K01

Can find recurrence relations in mathematical problems. Knows basic methods of solving recurrence relations following methods of mathematical induction, of characteristic equations, and of generating functions.K_W01, K_W04, K_W05, K_W06, K_U03, K_U09, K_U11, K_U16, K_U17, K_U29, K_K01

Assessment methods and assessment criteria:

The overall form of credit for the course: final exam

Classes in period "Academic year 2018/2019" (future)

Time span: 2018-10-01 - 2019-06-30
Choosen plan division:

see course schedule
Type of class: Class, 30 hours more information
Lecture, 30 hours more information
Coordinators: Jarosław Kotowicz
Group instructors: (unknown)
Students list: (inaccessible to you)
Examination: Examination
Course descriptions are protected by copyright.
Copyright by University of Bialystok.