Discrete Mathematics (5 cr)
Code: TX00CD83-3022
General information
- Enrollment
-
01.01.2020
Registration for the implementation has ended.
- Timing
-
09.01.2023 - 07.05.2023
Implementation has ended.
- Number of ECTS credits allocated
- 5 cr
- Mode of delivery
- On-campus
- Unit
- (2019-2024) School of ICT
- Campus
- Myllypurontie 1
- Teaching languages
- Finnish
- Seats
- 0 - 40
- Degree programmes
- Information and Communication Technology
- Teachers
- Ilpo Kuivanen
- Course
- TX00CD83
Implementation has 6 reservations. Total duration of reservations is 18 h 0 min.
Time | Topic | Location |
---|---|---|
Tue 14.03.2023 time 09:00 - 12:00 (3 h 0 min) |
Diskreetti matematiikka TX00CD83-3022 |
MPA5026
Luentosali
|
Tue 21.03.2023 time 09:00 - 12:00 (3 h 0 min) |
Diskreetti matematiikka TX00CD83-3022 |
MPA5026
Luentosali
|
Tue 28.03.2023 time 09:00 - 12:00 (3 h 0 min) |
Diskreetti matematiikka TX00CD83-3022 |
MPA5026
Luentosali
|
Tue 04.04.2023 time 09:00 - 12:00 (3 h 0 min) |
Diskreetti matematiikka TX00CD83-3022 |
MPA5026
Luentosali
|
Tue 11.04.2023 time 09:00 - 12:00 (3 h 0 min) |
Diskreetti matematiikka TX00CD83-3022 |
MPA5026
Luentosali
|
Tue 18.04.2023 time 09:00 - 12:00 (3 h 0 min) |
Diskreetti matematiikka TX00CD83-3022/ Web-sovellukset -koe |
MPA5026
Luentosali
|
Objective
After completing this course the student will be familiar with the basic concepts and facts in logic, set theory, relations, graphs and combinatorics. The student will have a vision of possible applications. In order to model technological systems and structures the student is able to utilize discrete models.
Content
1) Logic, theory of sets, relations and functions.
2) Combinatorics.
3) Graphs.
Evaluation scale
0-5
Assessment criteria, satisfactory (1)
1) Logic, theory of sets, relations and functions
The student is familiar with the concepts, notation and principles associated with proposition and predicate logic, set theory, relations and functions. The student is able to solve simple problems.
2) Combinatorics
The student is familiar with combinatorial concepts, notation and principles. The student is able to solve simple problems.
3) Graphs
The student is familiar with graph theoretic concepts, notation and principles. The student is able to solve simple problems.
Assessment criteria, good (3)
1) Logic, theory of sets, relations and functions
The student has a good command of the concepts, notation and principles associated with proposition and predicate logic, set theory, relations and functions. The student is able to solve fundamental problems.
2) Combinatorics
The student has a good command of combinatorial concepts, notation and principles. The student is able to solve fundamental problems.
3) Graphs
The student has a good command of graph theoretic concepts, notation and principles. The student is able to solve fundamental problems.
Assessment criteria, excellent (5)
1) Logic, theory of sets, relations and functions
The student has a deep understanding of the concepts, notation and principles associated with proposition and predicate logic, set theory, relations and functions. The student is able to solve challenging problems.
2) Combinatorics
The student has a deep understanding of combinatorial concepts, notation and principles. The student is able to solve challenging problems.
3) Graphs
The student has a deep understanding of graph theoretic concepts, notation and principles. The student is able to solve challenging problems.
Assessment criteria, approved/failed
1) Logic, theory of sets, relations and functions
The student is familiar with the concepts, notation and principles associated with proposition and predicate logic, set theory, relations and functions. The student is able to solve simple problems.
2) Combinatorics
The student is familiar with combinatorial concepts, notation and principles. The student is able to solve simple problems.
3) Graphs
The student is familiar with graph theoretic concepts, notation and principles. The student is able to solve simple problems.
Further information
Computer exercises will be included.