Course syllabus adopted 2022-01-27 by Head of Programme (or corresponding).
Overview
- Swedish nameDiskret matematik
- CodeTMV200
- Credits7.5 Credits
- OwnerTKITE
- Education cycleFirst-cycle
- Main field of studyMathematics
- DepartmentMATHEMATICAL SCIENCES
- GradingTH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail
Course round 1
- Teaching language Swedish
- Application code 52136
- Maximum participants180
- Open for exchange studentsNo
- Only students with the course round in the programme overview.
Credit distribution
Module | Sp1 | Sp2 | Sp3 | Sp4 | Summer | Not Sp | Examination dates |
|---|---|---|---|---|---|---|---|
| 0104 Examination 7.5 c Grading: TH | 7.5 c |
|
In programmes
- TKAUT - AUTOMATION AND MECHATRONICS ENGINEERING, Year 3 (elective)
- TKITE - SOFTWARE ENGINEERING, Year 1 (compulsory)
Examiner
Christian Johansson- Senior Lecturer, Algebra and Geometry, Mathematical Sciences
Eligibility
General entry requirements for bachelor's level (first cycle)Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.
Specific entry requirements
The same as for the programme that owns the course.Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.
Aim
This course is the first mathematics course and is a transition between gymnasium and university mathematics. The material is essential and central to computer science and information technology. The overall aim is to put mathematics in the right perspective and as an integrated part in the students' curriculum.Learning outcomes (after completion of the course the student should be able to)
- communicate mathematics, orally and in writing,
- describe the structure of mathematics with axioms, definitions and theorems,
- construct simple proofs and do mathematical reasoning,
- formulate arguments in terms of the language of logic,
- formulate mathematical relationships in terms of functions, relations and graphs,
- use induction in proofs and to describe sets,
- explain the elementary multiplicative structure of integers,
- solve linear Diophantine equations and perform computations with congruences,
- explain RSA cryptography, code and decode messages using this technique,
- solve simple combinatorial problems,
- use graphs to formulate and solve mathematical problems.
Content
The course consists of three main themes. Within each theme some relevant mathematical concepts will be studied. One and the same concept, such as proof for instance, may be dealt with in several different themes. The themes that are studied in the course are:Logic, functions and relations, and proof- Elementary number theory and the RSA algorithm
- Combinatorics and graphs
Organisation
The teaching is built around themes. Each theme includes a Theme lecture by an invited speaker on a concrete application where mathematics is essential. Involved mathematics is presented briefly and then studied more deeply within the rest of the course activities comprising:- Scheduled tutorials in groups aimed to reflect on the mathematical theory.
- Lectures highlighting and explaining the mathematical theory.
- Classes where problems connected with the theory are solved individually and in groups.
- Student presentations of selected problems.
Literature
Johan Jonasson and Stefan Lemurell: Algebra och diskret matematik, 2nd edition Studentlitteratur, Lund, 2013.
Examination including compulsory elements
Written exam. During the course students can gain bonus points by presenting solutions of the weekly exercises.
The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.