Official course description, subject to change:
Preliminary info last published 10/06-21

### Foundations of Computing - Discrete Mathematics BSc

##### Course info
Language:
English
ECTS points:
7.5
Course code:
BSFOCDM1KU
Participants max:
190
Offered to guest students:
yes
Offered to exchange students:
yes
Offered as a single subject:
yes
Price (single subject):
10625 DKK (incl. vat)
##### Programme
Level:
Bachelor
Programme:
BSc in Software Development
Semester
Efterår 2022
Start
29 August 2022
End
30 December 2022
##### Abstract

Discrete Mathematics covers different topics in mathematics, which support many disciplines in software development. The goal of this course is to give the students the ability to apply formal reasoning. The first part of the course is dedicated to learning how to construct logical proofs, proofs on set theory and proofs by induction, while the second half of the course builds upon the first part to cover number-theoretical concepts, graphs, combinatorics, discrete probabilities, and models of computation. The student will obtain the fundamental skill of computational thinking and will be better equipped to tackle technical subjects throughout the curriculum. The course is an introduction to discrete mathematics as a foundation to work within the fields of computer science, information technologies, and software development. The course develops the necessary terminology and conceptual tools needed for later courses.

This includes:

• formal reasoning, proofs, logic, set theory, sequences and sums
• number theory, combinatorics and (discrete) probability theory
• induction, recursion and counting
• relations and functions
• basic graph theory, language theory
• theory and models of computation, such as finite state machines, regular expressions and grammars
The course aims at providing a basic understanding of the mathematical foundations of computer science.
##### Description

Discrete Mathematics covers different topics in mathematics, which support many disciplines in software development. The goal of this course is to give the students the ability to apply formal reasoning. The first part of the course is dedicated to learning how to construct logical proofs, proofs on set theory and proofs by induction, while the second half of the course builds upon the first part to cover number-theoretical concepts, graphs, combinatorics, discrete probabilities, and models of computation. The student will obtain the fundamental skill of computational thinking and will be better equipped to tackle technical subjects throughout the curriculum. The course is an introduction to discrete mathematics as a foundation to work within the fields of computer science, information technologies, and software development. The course develops the necessary terminology and conceptual tools needed for later courses.

This includes:

• formal reasoning, proofs, logic, set theory, sequences and sums
• number theory, combinatorics and (discrete) probability theory
• induction, recursion and counting
• relations and functions
• basic graph theory, language theory
• theory and models of computation, such as finite state machines, regular expressions and grammars
The course aims at providing a basic understanding of the mathematical foundations of computer science.
##### Formal prerequisites
There are no formal prerequisites for this course.
##### 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 and infinite state machines
• Use models of computation and specification
• Use combinatorial reasoning
• Assess probabilities of events
• Use basic modular arithmetic
##### Ordinary exam
Exam type:
A: Written exam on premises, External (7-point scale)
Exam variation:
A33: Written exam on premises on paper with restrictions