Search course

Use the search function to find more information about the study programmes and courses available at Chalmers. When there is a course homepage, a house symbol is shown that leads to this page.

Graduate courses

Departments' graduate courses for PhD-students.

​​​​
​​

Syllabus for

Academic year
MVE505 - Discrete mathematics
 
Syllabus adopted 2016-02-17 by Head of Programme (or corresponding)
Owner: TKTEM
4,5 Credits
Grading: TH - Five, Four, Three, Not passed
Education cycle: First-cycle
Major subject: Mathematics
Department: 11 - MATHEMATICAL SCIENCES


Teaching language: Swedish

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 Summer course No Sp
0116 Examination 4,5c Grading: TH   4,5c   14 Mar 2017 pm SB,  09 Jun 2017 pm SB,  14 Aug 2017 pm SB

In programs

TKTEM ENGINEERING MATHEMATICS, Year 2 (compulsory)

Examiner:

Docent  Johan Wästlund



  Go to Course Homepage

Eligibility:

In order to be eligible for a first cycle course the applicant needs to fulfil the general and specific entry requirements of the programme(s) that has the course included in the study programme.

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

Written exam.


Page manager Published: Thu 04 Feb 2021.