Discrete Mathematics (3 cr)
Code: KTPM005-3010
General information
Enrollment
01.12.2023 - 31.01.2024
Timing
01.01.2024 - 31.07.2024
Number of ECTS credits allocated
3 op
Mode of delivery
Contact teaching
Unit
Teknologia
Teaching languages
- Finnish
Degree programmes
- Bachelor’s Degree in Business Information Technology
Teachers
- Simo Määttä
Groups
-
TTK23SDTTK23SD
- 08.01.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 09.01.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 15.01.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 16.01.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 22.01.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 23.01.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 29.01.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 30.01.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 05.02.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 06.02.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 12.02.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 13.02.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 19.02.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 20.02.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 26.02.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 27.02.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 11.03.2024 10:00 - 11:30, Diskreetti matematiikka KTPM005-3010
- 12.03.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 19.03.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
- 26.03.2024 12:30 - 14:00, Diskreetti matematiikka KTPM005-3010
Objective
Students will know basic computing mathematics, and the logical expressions required in programming, the significance of mathemtical models and the basics of probability calculation.
Content
Clarifying logical expressions
Numerical systems and their conversions
Boolean algebra
Set theory
An introduction to probability calculation and its applications
Evaluation scale
0 - 5
Assessment criteria, excellent (5)
The students know how to form and reduce logic expressions. They know the operations of set theory and can form and reduce mathematical expressions using them. They can draw logic circuits from Boolean expressions and know the transformations between different number systems and calculations. They know how to calculate the amount of sequences and subsets and demanding probabilities.
Assessment criteria, good (3)
The students know what logic connectives are and can form truth value tables between them. They know the operations and rules of calculating set theory and can draw logic circuits from Boolean expressions. The students are proficient in the transformations between different number systems and can calculate probabilities using product calculation and addition rules.
Assessment criteria, satisfactory (1)
The students know what logical connectives mean, and they know the operations of set theory and can draw Venn diagrams using them. They can draw simple, logic circuits from Boolean expressions. They can do number system transformations between 10 and 2 systems and know other number systems. They can carry out simple calculations of probability.