University of Warsaw - Central Authentication System

Discrete mathematics

General data

Course ID:	1000-711MAD
Erasmus code / ISCED:	11.3 The subject classification code consists of three to five digits, where the first three represent the classification of the discipline according to the Discipline code list applicable to the Socrates/Erasmus program, the fourth (usually 0) - possible further specification of discipline information, the fifth - the degree of subject determined based on the year of study for which the subject is intended. / (0612) Database and network design and administration The ISCED (International Standard Classification of Education) code has been designed by UNESCO.
Course title:	Discrete mathematics
Name in Polish:	Matematyka dyskretna
Organizational unit:	Faculty of Mathematics, Informatics, and Mechanics
Course groups:	Obligatory courses for 1st year Bioinformatics
ECTS credit allocation (and other scores):	4.50 Basic information on ECTS credits allocation principles: the annual hourly workload of the student’s work required to achieve the expected learning outcomes for a given stage is 1500-1800h, corresponding to 60 ECTS; the student’s weekly hourly workload is 45 h; 1 ECTS point corresponds to 25-30 hours of student work needed to achieve the assumed learning outcomes; weekly student workload necessary to achieve the assumed learning outcomes allows to obtain 1.5 ECTS; work required to pass the course, which has been assigned 3 ECTS, constitutes 10% of the semester student load. view allocation of credits
Language:	Polish
Type of course:	obligatory courses
Short description:	Foundations of discete mathematics (combinatorial objects and their counting) and set theory (sets, functions, relations).
Full description:	Counting methods: induction, recursive equation solving, finite sums, asymptotics. Combinatorial objects: permutations, graphs, trees, words. Set theory: sets, functions, relations (including orders and equivalence relations), cardinality.
Bibliography:	Kenneth A. Ross, Charles R. B. Wright, Discrete Mathematics, Prentice Hall, 1988 Ronald L. Graham, Donald E. Knuth, Oren Patashnik, Concrete Mathematics, Addison-Wesley, 1994
Learning outcomes:	A student finishing the course: - can carry out inductive proofs, count objects, calculate finite sums, solve recursive equations, prove properties of Newton's binomial combinatorially; - understands the concepts of sets, functions, relations and powers of sets, can analyze bijections, determine the cardinality of quotient sets and equivalence classes, knows and can use the Cantor-Bernstein theorem; - knows basic data structures such as trees and graphs; - can apply the above knowledge and skills to analyze the complexity of simple algorithms and study the size of data, understands the need for such analysis.
Assessment methods and assessment criteria:	Admission to the exam based on homeworks, final assessment based on tests and writing exam.

Classes in period "Summer semester 2024/25" (past)

Time span:	2025-02-17 - 2025-06-08	Selected timetable range: weekly course term Go to timetable MO WYK CW TU W TH FR CW
Type of class:	Classes, 30 hours more information Lecture, 30 hours more information
Coordinators:	Wanda Niemyska
Group instructors:	Łukasz Bożyk, Wanda Niemyska
Students list:	(inaccessible to you)
Credit:	Examination

Classes in period "Summer semester 2025/26" (in progress)

Time span:	2026-02-16 - 2026-06-07	Selected timetable range: weekly course term Go to timetable MO CW CW TU W TH WYK FR
Type of class:	Classes, 30 hours more information Lecture, 30 hours more information
Coordinators:	Wanda Niemyska
Group instructors:	Anna Lisiecka, Wanda Niemyska
Students list:	(inaccessible to you)
Credit:	Course - Examination Lecture - Examination

Course descriptions are protected by copyright.
Copyright by University of Warsaw.