Discrete Mathematics, 6 credits (TATA65)

Diskret matematik, 6 hp

Main field of study

Mathematics Applied Mathematics


First cycle

Course type

Programme course


Carl Johan Casselgren

Director of studies or equivalent

Jesper Thorén
Course offered for Semester Period Timetable module Language Campus VOF
6CDDD Computer Science and Engineering, M Sc in Engineering 1 (Autumn 2017) 0, 1 -, 2 Swedish Linköping o
6CMJU Computer Science and Software Engineering, M Sc in Engineering 1 (Autumn 2017) 0, 1 -, 2 Swedish Linköping o

Main field of study

Mathematics, Applied Mathematics

Course level

First cycle

Advancement level


Course offered for

  • Computer Science and Engineering, M Sc in Engineering
  • Computer Science and Software Engineering, M Sc in Engineering

Entry requirements

Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshold requirements for progression within the programme, or corresponding.

Intended learning outcomes

The course provides the conceptual framework and the techniques in discrete mathematics used in software development, theoretical computer science, database theory and also in further studies in discrete mathematics. After the course students will be able to read and understand literature and articles of a theoretical nature in the computer sciences, and structure and present the content in these, which means that the student:

  • can assimilate and apply the language and operations of set theory and be familiar with the definitions and properties of relations and functions
  • will be able to prove statements by use of mathematical induction, as well as understand links between induction and recursion
  • can organize, formulate and solve combinatorial problems on permutations and combinations
  • has mastered the basics of integer arithmetics and congruence calculation and applications in cryptography
  • has a good knowledge of rules and structures of Boolean algebras and partial orders
  • knows graph theory terminology and applications such as tree and graph coloring and can use graph theory as a tool for modeling

Course content

Set theory with operations, Venn diagrams and counting. Relations. The
Binomial theorem. Permutations and Combinations. The Principle of
inclusion and exclusion. Induction and recursion. Graphs, trees, binary
trees. The coloring of graphs. Chromatic numbers and polynomials.
Number theory. Congruences. The Euclidean algorithm and Diophantine
equations. Partial orders and equivalence relations with partitions.
Lattice and Boolean functions.

Teaching and working methods

Lectures and lessons.


UPG1AssignmentsU, G2 credits
TEN1Written examinationU, 3, 4, 54 credits


Four-grade scale, LiU, U, 3, 4, 5


Matematiska institutionen

Director of Studies or equivalent

Jesper Thorén


Carl Johan Casselgren

Education components

Preliminary scheduled hours: 80 h
Recommended self-study hours: 80 h

Course literature

Fastställs senare
Fastställs senare
UPG1 Assignments U, G 2 credits
TEN1 Written examination U, 3, 4, 5 4 credits

Regulations (apply to LiU in its entirety)

The university is a government agency whose operations are regulated by legislation and ordinances, which include the Higher Education Act and the Higher Education Ordinance. In addition to legislation and ordinances, operations are subject to several policy documents. The Linköping University rule book collects currently valid decisions of a regulatory nature taken by the university board, the vice-chancellor and faculty/department boards.

LiU’s rule book for education at first-cycle and second-cycle levels is available at http://styrdokument.liu.se/Regelsamling/Innehall/Utbildning_pa_grund-_och_avancerad_niva. 

This tab contains public material from the course room in Lisam. The information published here is not legally binding, such material can be found under the other tabs on this page. There are no files available for this course.

Page responsible: Info Centre, infocenter@liu.se