| TATA52 |
Discrete Mathematics, 4 ECTS credits.
/Diskret matematik/
For:
I
Ii
|
| |
Prel. scheduled
hours: 46
Rec. self-study hours: 61
|
| |
Area of Education: Science
Main field of studies: Mathematics, Applied Mathematics
|
| |
Advancement level
(G1, G2, A): G1
|
|
Aim:
The course shall provide the basic knowledge within the part of mathematics which has applications in software development, theoretical computer sciences, database theory and digital technology. Students shall be able to:
- Apply set theory to calculations and to theoretical computer sciences.
- Use equivalence relations.
- Use induction in proofs and solve simple recursive equations.
- Apply combinatorial methods in calculations.
- Know several concepts in graph theory and number theory, as well as applications to coding theory and cryptography.
|
|
Prerequisites: (valid for students admitted to programmes within which the course is offered)
Single variable calculus and linear algebra
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.
|
|
Supplementary courses:
Combinatorics, Graph theory, Number theory, Abstract algebra
|
|
Organisation:
Lectures and tutorials.
|
|
Course contents:
Sets, relations, functions, induction, recurrence, combinatorics, number theory, graphs.
|
|
Course literature:
Kenneth H. Rosen: Discrete Mathematics and Its Applications (with MathZone), McGraw-Hill Higher Education, 2006
Alternativt Asratian, A., Björn, A. och Turesson, B.O.: Diskret matematik, 2011.
eller: Grimaldi, R.P.: Discrete and Combinatorial Mathematics, 1999.
|
|
Examination: |
|
Written examination
|
4 ECTS
|
| |
|
|
Course language is Swedish/English.
Department offering the course: MAI.
Director of Studies: Jesper Thorén
Examiner: Milagros Izquierdo Barrios
Link to the course homepage at the department
Course Syllabus in Swedish
|