Discrete Mathematics 0600-IS1-1MDY
Course profile: General Academic
Form of study: Full-time studies
Course type: Basic
Year/semester of study: 1 / 2
Prerequisites (sequential system of courses and exams): Items introducing: Elements of Logic and Set Theory, Linear Algebra with Analytic Geometry, Mathematical Analysis 1,
Lecture: 30 Exercise classes: 30
Teaching methods: Lectures. Exercise classes where students solve simple tasks and problems from combinatorics, graph theory, and number theory.
ECTS credits: 5
Balance of student workload:
Class attendance:
- lecture 30h
- exercise classes 30h
Course preparation:
- lecture 10h
- exercise classes 15h
Literature study: 5h
Reports, homeworks: 10h
Preparation for tests: 8h
Preparation for the exam: 15h
Exam duration: 2h
Individual consultation with the teacher: 3h
Student workload:
Direct interaction with the teacher: 65, 2 ECTS
Practical exercises: 45, 2 ECTS
Type of course
Learning outcomes
Learning outcomes:
The student knows mathematical tools necessary to construct and analyse algorithms. K_W01
The student knows basic notions of combinatorics, graph theory, and number theory. K_W01
The students can apply combinatorics, recurrence, and mathematical induction to solve simple computational problems. K_U02, K_U04
The student can apply the breath-first search method to searching of the shortest path in a weighed graph. K_U06
The student understands the need of continual learning. K_K02
Assessment criteria
Form of assessment: class tests and the final exam (written or oral).
Bibliography
Bibliography:
K.A.Ross, Ch.R.B.Wright, Matematyka dyskretna, PWN, Warszawa 1996
R.L.Graham, D.E.Knuth, O.Patashnik, Matematyka konkretna, PWN, Warszawa 1996
Z.Palka, A.Ruciński, Wykłady z kombinatoryki, WNT, Warszawa 1998
Kenneth H. Rosen, Discrete mathematics and its applications, Seventh edition, McGraw-Hill
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: