Official course description:
Basic info last published 26/02-19

### Discrete Mathematics, MSc SD

##### Course info
Language:
English
ECTS points:
7.5
Course code:
KSDIMAT1KU
Offered to guest students:
-
Offered to exchange students:
Offered as a single subject:
-
##### Programme
Level:
MSc. Master
Programme:
M.Sc. in IT, Software Development and Technology
Semester
Efterår 2018
Start
27 August 2018
End
28 December 2018
##### Abstract

The course is an introduction to discrete mathematics as a foundation to work within the fields of computer science, information technologies, and software development.

##### Description

Mathematics and logic are our key tools for both understanding computers and for modelling the world around us. Abstractions from mathematics pervade computer science, and to truly excel at both programming computers and model aspects of the real world in computers, one must understand the core vocabulary of mathematics provided in this course.

The course aims at providing the basics of the mathematical foundations of computer science.

The course develops the necessary terminology and conceptual tools needed for later courses. This includes:

• formal reasoning, induction, set theory, relations and functions
• models of computation, such as finite state machines and grammars
• basic graph theory, language theory
• combinatorics, probability and number theory

Central terms and concepts: Logic, specifications, sets and sequences, functions, sums, induction and recursion, number theory, permutations and combinations, discrete probability, relations, graphs, trees, finite state machines, grammars and theory of computation.

##### Formal prerequisites
Basic arithmetic. Please note that this course is not open to bachelor-students. Instead bachelor students can take the SWU Bachelor course: Foundations of Computing - Discrete Mathematics BSc.
##### Intended learning outcomes

After the course, the student should be able to:

• Describe and apply formal definitions
• Conduct and explain basic formal proofs
• Work with regular languages and finite state machines
• Use models of computation and specification
• Use combinatorial reasoning
• Assess probabilities of events
• Use basic modular arithmetic
##### Ordinary exam
Exam type:
X: Special exam type, external (7-trinsskala)
Exam description:
4 hours written exam with no aids. There is no access to advanced electronic tools such as computers, e-Readers or tablets. Only old-fashioned pocket calculators and standard tools for writing on paper are allowed (pen, pencil, eraser, etc.). Only use of pen is allowed for the final exam hand-in. Form of re-exam is the same as the ordinairy exam.