Search programme

​Use the search function to search amongst programmes at Chalmers. The study programme and the study programme syllabus relating to your studies are generally from the academic year you began your studies.

​

Syllabus for

 Academic year
TMV200 - Discrete mathematics  
 
Syllabus adopted 2014-02-25 by Head of Programme (or corresponding)
Owner: TKITE
7,5 Credits
Grading: TH - Five, Four, Three, Not passed
Education cycle: First-cycle
Major subject: Mathematics
Department: 11 - MATHEMATICAL SCIENCES


Teaching language: Swedish
Maximum participants: 150

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 Summer course No Sp
0104 Examination 7,5 c Grading: TH   7,5 c   15 Jan 2016 pm M,  07 Apr 2016 pm SB,  26 Aug 2016 pm SB

In programs

TKITE SOFTWARE ENGINEERING, Year 1 (compulsory)
TKELT ELECTRICAL ENGINEERING, Year 3 (compulsory elective)
TIDAL COMPUTER ENGINEERING, Year 3 (compulsory elective)

Examiner:

Gästlärare  Seidon Alsaody


Replaces

TMA245   Mathematics for IT


  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.

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


Some basic concepts such as sets and functions appear in the introduction course which precedes this one, but play an important role when they are studied in more depth in this course.

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

Written exam. During the course students can gain bonus points by presenting solutions of the weekly exercises.

Page manager Published: Mon 28 Nov 2016.