(in Polish) Discrete Mathematics 420-IS1-1MDY-ENG
Course profile: General Academic
Form of study: Full-time studies
Course type: Basic
Field of science: natural sciences,
Discipline of science: computer science
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,
ECTS credits: 5
Balance of student workload:
Class attendance:
- lecture 30h
- exercise classes 30h
Course preparation:
- lecture 5h
- exercise classes 20h
Literature familiarization: 10h
Preparation for tests: 20h
Preparation for the exam: 20h
Test duration: 2h
Exam duration: 2h
The total number of hours of exams and tests: 4h
Individual consultation with the teacher: 2h
Student workload:
- that requires direct interaction with the teacher: 66h, 2 ECTS
- that does not require direct interaction with the teacher: 75h, 3 ECTS
Type of course
Mode
Requirements
Prerequisites
Course coordinators
Learning outcomes
Learning outcomes:
The student knows mathematical tools necessary to construct and analyse algorithms. KP6_WG3
The student knows basic notions of combinatorics, graph theory, and number theory. KP6_WG1
The student can use the concepts and properties of functions, sequences and series to solve simple problems of a recursive nature. KA6_UW2
The students can apply combinatorics, recurrence, and mathematical induction to solve simple computational problems. KP6_UW4
The student can apply the breath-first search method to searching of the shortest path in a weighed graph. KP6_UW6
The student is able to independently implement an algorithm using the selected programming language KA6_UW8
The student understands the need of continual learning. KP6_UU1
Assessment criteria
Form of assessment: class tests and the final exam (written or oral).
Bibliography
Kenneth H. Rosen, Handbook of discrete and combinatorial mathematics (Discrete mathematics and its applications - 1st Edition), CRC Press.
Ralph P. Grimaldi, Discrete and combinatorial mathematics: An applied introduction, 2nd Edition.
Kenneth A. Ross, Charles R.B. Wright, Discrete mathematics, 5th Edition
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: