Discrete Mathematics 420-IS1-1MDY
Course profile: General Academic
Form of study: Full-time studies
Course type: Basic
Field of science: natural sciences
Discipline of science: mathematics/informatics
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 basic notions of logic and discrete mathematics, algebra and mathematical analysis. KA6_WG1
The student knows mathematical tools necessary to construct and analyse algorithms. KA6_WG3
The student can use methods of mathematical analysis to solve problems: concepts and properties of functions, sequences and series, limits and continuity of functions of one variable. KA6_UW2
The students can use the apparatus of mathematical logic to describe and verify facts, can use inductive reasoning and deductive reasoning. KP6_UW4
The student is also able to independently design algorithms that implement selected tasks, is able to perform complexity analysis of a given algorithm. KP6_UW6
The student understands the need to improve his/her skills and qualifications, monitors the development of technology and IT tools. KP6_UU1
Assessment criteria
Form of assessment: class tests and the final exam (written or oral).
Bibliography
Bibliography:
1. Kenneth H. Rosen, Handbook of discrete and combinatorial mathematics (Discrete mathematics and its applications - 1st Edition), CRC Press.
2. Ralph P. Grimaldi, Discrete and combinatorial mathematics: An applied introduction, 2nd Edition.
3. Kenneth A. Ross, Charles R.B. Wright, Discrete mathematics, 5th Edition
Additional bibliography:
1. Cordelia Hall , John O’Donnell, Discrete Mathematics Using a Computer , Springer London, 2000
2. A. K. Agarwal, Bruce C. Berndt, Christian F. Krattenthaler, Gary L. Mullen, K. Ramachandra, Michel Waldschmidt, Number Theory and Discrete Mathematics, Hindustan Book Agency Gurgaon, 2002
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: