Discrete Mathematics, 6 credits (TATA65)

Diskret matematik, 6 hp

Main field of study

Mathematics Applied Mathematics

First cycle

Programme course

Examiner

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

First cycle

G1X

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.

Examination

 UPG1 Assignments U, G 2 credits TEN1 Written examination U, 3, 4, 5 4 credits

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

Department

Matematiska institutionen

Jesper Thorén

Examiner

Carl Johan Casselgren

http://www.mai.liu.se/und/kurser/index-amne-tm.html

Education components

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

Course literature

Fastställs senare
Fastställs senare