Course syllabus adopted 2022-02-09 by Head of Programme (or corresponding).
Overview
- Swedish nameDiskret matematik
- CodeMVE505
- Credits4.5 Credits
- OwnerTKTEM
- 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 59119
- 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 |
|---|---|---|---|---|---|---|---|
| 0116 Examination 4.5 c Grading: TH | 0 c | 0 c | 0 c | 4.5 c | 0 c | 0 c |
|
In programmes
Examiner
Peter Hegarty- Professor, 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.
Course specific prerequisites
One-variable calculus, linear algebra, basic probability theoryAim
The overall purpose is to provide basic knowledge of discrete structures and their applications in mathematics, computer science and optimization.Learning outcomes (after completion of the course the student should be able to)
To understand an being able to apply basic discrete structures and models. To master basic number theory and have knowledge about its use in secure communication. To understand and use notions from set theory. Understand and use recursive definitions and induction. Familiarity with some problems that can be modeled and solved using graph theory.Content
Algebra and number theory with applications to error correcting codes and cryptology. Sets, functions and relations. Induction, recursion and analysis of algorithms. Enumerative combinatorics and probabilities. Permutations and symmetris. Graphs and optimization problems on graphs.Organisation
Lectures and exercisesLiterature
K. Eriksson, H. Gavel: Diskret matematik och diskreta modeller, Studentlitteratur, upplaga 2, 2013 andK. Eriksson, H. Gavel: Diskret matematik, fördjupning, Studentlitteratur, upplaga 1, 2003
Examination including compulsory elements
Written exam.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.