| TADI03 |
Discrete Mathematics, 4 ECTS credits.
/Diskret matematik/
For:
DI
Kem
|
| |
Prel. scheduled
hours: 42
Rec. self-study hours: 65
|
| |
Area of Education: Science
Main field of studies: Mathematics, Applied Mathematics
|
| |
Advancement level
(G1, G2, A): G1
|
|
Aim:
To give tha basic knowledge of discrete mathematics that is needed for further courses in mathematics, natural and computer science. After completing the course the student should be able to
- understand and use the terminology and laws of set theory
- formulate and solve combinatorial problems on combinations and permutations
- use the principle of mathematical induction to prove theorems and formulas
- use the Euclidean algorithm to solve Diophantine equations
- master the foundations of graph theory and use graphs as a tool to model real-life problems
|
|
Prerequisites: (valid for students admitted to programmes within which the course is offered)
Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding.
|
|
Organisation:
Teaching is done through lectures and problem sessions
|
|
Course contents:
Set theory, the laws of set theory and Venn diagrams.
Mathematical induction and recursion.
Combinatorics with permutations and combinations.
Number theory and logic.
Graphs: Euler tours, trees and some applications in sports and communication networks.
|
|
Course literature:
Asratian, A., Björn A. and Turesson, B.O: Kompendium i Diskret Matematik
|
|
Examination: |
|
Written examination
|
4 ECTS
|
| |
|
|
Course language is Swedish.
Department offering the course: MAI.
Director of Studies: Jesper Thorén
Examiner: Armen Asratian
Link to the course homepage at the department
Course Syllabus in Swedish
|