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
TMV210 - Introduction to discrete mathematics  
Inledande diskret matematik
 
Syllabus adopted 2019-02-08 by Head of Programme (or corresponding)
Owner: TKDAT
7,5 Credits
Grading: TH - Five, Four, Three, Fail
Education cycle: First-cycle
Major subject: Mathematics
Department: 11 - MATHEMATICAL SCIENCES


Teaching language: Swedish
Application code: 49138
Open for exchange students: No
Only students with the course round in the programme plan

Module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 Summer course No Sp
0104 Examination 7,5 c Grading: TH   7,5 c   26 Oct 2019 pm H   08 Jan 2020 am SB_MU   28 Aug 2020 pm J

In programs

TKDAT COMPUTER SCIENCE AND ENGINEERING, Year 1 (compulsory)
TIDAL COMPUTER ENGINEERING, Year 2 (compulsory)

Examiner:

Jakob Palmkvist

  Go to Course Homepage

Replaces

TMV105   Mathematics


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 introduction gives basic knowledge about some discrete mathematical structures in different contexts, in particular those that have connection to and are suitable for computing.

Learning outcomes (after completion of the course the student should be able to)


  • have insight into fundamental mathematics important when studying Technology, especially within computing science and information Systems.

  • have insight, skills and understanding in using mathematical language.
  • have insight into rigorous mathematical reasoning and proof and be able to communicate this orally and in writing
  • have gained experience of mathematical problem-solving

Content

The course consists of several themes. With in each theme some relevant mathematical concepts will be studied. One and the same concept may be dealt with in several different themes. The concepts that are studied in the course are:



  • Logic
  • Some fundamental mathematical concepts: set theory, functions, relations

  • Proof techniques; direct proofs, induction and recursion, proof by contradiction

  • Elementary number theory

  • Combinatorics


  • Graph theory

More detailed lists of learning outcomes for the different parts of the course can be found on the current course homepage:



Organisation

The activities in the course are

  • Lectures, where the course material is first presented
  • Tutorials devoted to (i) demonstration of exercises, mainly but not only from the textbook, at the board (ii) self-study
  • Homework exercises which are solved in groups and presented orally before the whole class for bonus points (kryssuppgifter)
  • Maple-TA exercises (possibly, not decided yet for Autumn 2016)
  • SI-activity (teacher not involved)

Literature

Johan Jonasson och Stefan Lemurell: Algebra och diskret matematik, Studentlitteratur, Lund, 2004.

Examination including compulsory elements

Written exam. Bonus points from the kryssuppgifter (and possibly Maple-TA) are included.


Page manager Published: Thu 04 Feb 2021.