GMI23G Logic and Mathematics for Computer Science

Dalarna University - Spring 2026

• Institution: Dalarna University
• Department: Information and Technology
• Credits: 7.5 ECTS
• Location: Borlänge Campus
• Instructors: Dr. Ross May (rom@du.se) and Dr. Charlie Lindgren (clg@du.se)

 

Registration

You can see parts of this course room even if you are not registered in the course. Be sure to register if you are going to read the course - only then will you get access to all the material. Registration takes place via Ladok. If you have questions about registration, contact support@du.se.

Ladok

 

Course Overview

This course introduces Discrete Mathematics concepts essential for computer science, focusing on logic, proofs, algorithms, and discrete structures. It follows Kenneth H. Rosen's Discrete Mathematics and Its Applications. The core material is covered thoroughly, with extra attention to the basics.

 

Textbook Purchase - 30% Discount Available

Discrete Mathematics and Its Applications: 2025 Release ISE – 30% off eBook:

1. Go to: https://www.mheducation.co.uk/discrete-mathematics-and-its-applications-2025-release-ise-9781266191541-emea-group
2. Make sure that your current country/territory in the top right corner is set to your current country (i.e. Sweden)
3. Select your Purchase options
4. Click on Lifetime *add to cart
5. Click on Guest Checkout to continue
6. Scroll down to apply the discount code MGH30CB *this will provide an additional 30% off the eBook
7. Fill in the remaining purchase information to get the eBook and then purchase

 

Course Content

The course covers algebraic systems, including modular arithmetic. Logic and set theory are covered, as are graph theory, predicate calculus, truth tables, sets and set operators, functions, and relations.

The course also covers elementary concepts in:

• Number Theory: Divisibility, modular arithmetic, congruences, primes, and the Euclidean algorithm.
• Induction & Recursion: Mathematical induction, strong induction, and recursive algorithms.
• Combinatorics: Basic counting principles, permutations, combinations, and the binomial theorem.
• Discrete Structures: Relations, graphs, and trees.

The theoretical content of the course is explored through programming exercises to demonstrate how computer science has a foundation in logic and mathematics.

 

Intended Learning Outcomes

On completion of the course, students shall be able to:

• Describe and use various algebraic systems such as modular arithmetic.
• Use basic concepts such as predicate calculus, set theory, relations, and graph theory, and apply this knowledge to computer science.
• Implement algorithms based on elementary number theory such as common divisors and factorisation.
• Apply induction and recursion to problem solving and programming, with an emphasis on working with combinatorial problems.
• Relate logic and mathematics to computer science.

 

Forms of Study

The course is delivered through a combination of:

• Lectures: Covering theoretical foundations.
• Laboratories: Practical programming exercises using Sage Python.
• Quizzes: Five-question pen-and-paper assessments covering recent chapter sections.
• Exercises: Odd-numbered problems from the relevant sections of the textbook.

 

Assessment Overview

Component	Description	Weight
Written Test	All course content is examinable; however, since the exam is limited in time and space, some content will not show up.	60%
Laboratory Exercises	Programming exercises applying theoretical content.	40%

Grades: Swedish scale U-G.

 

Course Policies

• Attendance: Attendance is expected at all course occasions. A roll call and register will be taken if deemed appropriate, i.e. if there is evidence of poor attendance.
• Academic Integrity: Policies of Dalarna University apply to all submitted work.
• Quizzes: Solutions must be handed in at the end of the session. If multiple pages are used, please fold the corners together.

 

Quick Links

Reading List