Course syllabus for Discrete mathematics

Course syllabus adopted 2019-02-22 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 59113
  • Maximum participants50
  • Open for exchange studentsNo
  • Only students with the course round in the programme overview.

Credit distribution

0116 Examination 4.5 c
Grading: TH		 4.5 c
  • 16 Mar 2021 pm J
  • 10 Jun 2021 pm J
  • 25 Aug 2021 pm J

In programmes

Examiner

Go to coursepage (Opens in new tab)

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 theory

Aim

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 the at 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 exercises

Literature

K. Eriksson, H. Gavel: Diskret matematik och diskreta modeller, Studentlitteratur, upplaga 2, 2013 and
K. Eriksson, H. Gavel: Diskret matematik, fördjupning, Studentlitteratur, upplaga 1, 2003

Examination including compulsory elements

Written exam.