Print Course syllabus
Course syllabus - Discrete Mathematics
Scope
7.5 credits
Course code
MMA122
Valid from
Autumn semester 2022
Education level
First cycle
Progressive Specialisation
G1N (First cycle, has only upper-secondary level entry requirements).
Main area(s)
Mathematics/Applied Mathematics
School
School of Education, Culture and Communication
Ratified
2013-02-01
Revised
2021-12-14
Literature lists
Course literature is preliminary up to 8 weeks before course start. Course literature can be valid over several semesters.
-
Books
Discrete mathematics and discrete models
1. ed. : Lund : Studentlitteratur, 2015 - 329 s.
ISBN: 9789144106427 LIBRIS-ID: 17464030
Diskret matematik och diskreta modeller
2. uppl. : Lund : Studentlitteratur, 2013 - 327 s.
ISBN: 9789144089997 LIBRIS-ID: 14219755
Diskret matematik och diskreta modeller.
Lund : Studentlitteratur, 2002 - ix, [1], 355 s.
ISBN: 91-44-02465-7 : 493:00 LIBRIS-ID: 8604379
Other Materials
-
Books
Diskret matematik och diskreta modeller.
Lund : Studentlitteratur, 2002 - ix, [1], 355 s.
ISBN: 91-44-02465-7 : 493:00 LIBRIS-ID: 8604379
Discrete mathematics and discrete models
1. ed. : Lund : Studentlitteratur, 2015 - 329 s.
ISBN: 9789144106427 LIBRIS-ID: 17464030
Other Materials
Objectives
The aim of the course is to introduce the basic concepts and methods in discrete mathematics, and to give improved proficiency in mathematical modeling, problem solving and reasoning, as a basis for further studies in mathematics and computer science.
Learning outcomes
At the end of the course the student is expected to be able to
- explain, in a way adapted to the mathematical level of the reader/listener, the concepts presented in this course,
- describe some application of each of the subareas of the course content,
- use properly the set algebraic operations and set up models to solve problems by set algebraic means, and describe the relation between propositional logic and boolean algebra
- formulate and interpret statements written in the notation of predicate logic,
- give an account of the concepts of prime numbers and divisors, and apply Euclid's algorithm to problems such as linear modular equations,
- prove theorems by induction, and solve problems that rely on recursion,
- describe and apply the fundamental methods and principles of combinatorics and probability theory,
- use basic graph theoretic terminology and set up models to solve problems by graph theoretic means,
- construct and interpret automata, and describe the relation between automata and regular languages.
Course content
Set theory. Arithmetic. Recursion and induction. Combinatorics and probability. Graph theory. Logic. Automata and formal languages.
Tuition
Lectures and group work sessions.
Requirements
Basic eligibility and Mathematics 3b or 3c or Mathematics C
Examination
MUN1, Oral examination, 4.5 credits, individual oral examination concerning all learning outcomes, grades Fail (U), Pass (G) or Pass with distinction (VG).
OVN3, Exercise, 2 credits, oral and written presentation of solutions to problems concerning all learning outcomes, grades Fail (U) or Pass (G).
INL1, Written assignment, 1 credit, individual assignment concerning all learning outcomes, grades Fail (U), Pass (G) or Pass with distinction (VG).
The course as a whole has grades Fail (U), 3, 4 or 5. For grade 5, the student must have earned VG on both MUN1 and INL1. For grade 4, the student must have earned VG on either MUN1 or INL1.
A student who has a certificate from MDU regarding a disability has the opportunity to submit a request for supportive measures during written examinations or other forms of examination, in accordance with the Rules and Regulations for Examinations at First-cycle and Second-cycle Level at Mälardalen University (2020/1655). It is the examiner who takes decisions on any supportive measures, based on what kind of certificate is issued, and in that case which measures are to be applied.
Suspicions of attempting to deceive in examinations (cheating) are reported to the Vice-Chancellor, in accordance with the Higher Education Ordinance, and are examined by the University’s Disciplinary Board. If the Disciplinary Board considers the student to be guilty of a disciplinary offence, the Board will take a decision on disciplinary action, which will be a warning or suspension.
Grade
Pass with distinction, Pass with credit, Pass, Fail