Discrete Mathematics, 6 credits (TADI31)

Diskret matematik, 6 hp

Main field of study

Mathematics Applied Mathematics

Level

First cycle

Course type

Programme course

Examiner

Daniel Carlsson

Director of studies or equivalent

Jesper Thorén
Course offered for Semester Period Timetable module Language Campus VOF
6IDAT Computer Engineering, Bachelor of Science in Engineering 3 (Autumn 2019) 2 1+3 Swedish Linköping o
6KKEM Chemistry - Molecular Design, Bachelor's Programme 5 (Autumn 2019) 2 1+3 Swedish Linköping v

Main field of study

Mathematics, Applied Mathematics

Course level

First cycle

Advancement level

G1X

Course offered for

  • Bachelor of Science in Computer Engineering
  • Chemistry - Molecular Design, Bachelor's Programme

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

To give the basic knowledge of discrete mathematics that is needed for further courses in mathematics, natural and computer science. After completing the course the student should be able to

  • use the Euclidean algorithm to solve Diophantine equations
  • use the principle of mathematical induction to solve recursive problems
  • understand and use the terminology and laws of set theory
  • formulate and solve combinatorial problems on combinations and permutations
  • master the foundations of graph theory and use graphs as a tool to model real-life problems
  • use the language of propositional logic, be familiar to logic operations and be able to evaluate the validity of logical conclusions.

Course content

Number theory; prime numbers, divisibility, Euclidean algorithm, Diophantine equations,
Mathematical induction and recursion.
Set theory, the laws of set theory and Venn diagrams.
Combinatorics with permutations and combinations. 
Graphs: Euler paths, Hamilton cycles, trees and some applications in computer science
Logic; propositional logic, logic operations, truth tables and conclusions.

Teaching and working methods

Teaching is done through lectures and problem sessions

Examination

TEN1A written examinationU, 3, 4, 54 credits
UPG1Hand-in-assignmentU, G2 credits

Grades

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

Department

Matematiska institutionen

Director of Studies or equivalent

Jesper Thorén

Examiner

Daniel Carlsson

Education components

Preliminary scheduled hours: 50 h
Recommended self-study hours: 110 h

Course literature

Compendiums
Asratian, A., Björn A. och Turesson, B. O., Diskret matematik

Compendia

Asratian, A., Björn A. och Turesson, B. O., Diskret matematik
TEN1 A written examination U, 3, 4, 5 4 credits
UPG1 Hand-in-assignment U, G 2 credits

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: Study information, bilda@uf.liu.se