Discrete Mathematics

Education facts

Code: MA4030

Logic, proofs and basic number theory:<br> Logic: negation, conjunction, disjunction, implication, bi-implication (equivalence), de Morgan's law, quantifiers, divisibility, modular arithmetic, fundamental theorem of arithmetic, proof by induction. Combinatorics and recurrence relations:<br> Basic combinatorics: permutations, combinations, variations. Inclusion/exclusion principle. The aspects of recurrence relations: arithmetic and geometric sequences, linear nonhomogeneous recurrence relations with constant coefficients, simultaneous recurrence relations. Graph theory and Graph algorithms:<br> Definitions and properties of different types of graphs: simple, undirected/directed, tree, planar, eulerian and hamiltonian graph, spanning tree, TSP (Travelling salesman problem) etc. DFS (Depth First Search) and BFS (Breadth First Search), Dijkstra’s, Prim’s and Kruskal’s algorithms. Modeling: Project where the student implements and tests simple graph algorithms in a programming language of their choice, e.g. Python.

Entry requirements

Programming 7.5 credits. English 6 or English level 2. Exemption of the requirement in Swedish is granted for those with foreign grades.

Education offerings

Each offering has its own dates and conditions. Closed offerings are retained as history and do not mean that a new application is open.

• Discrete Mathematics

  Halmstad University

  Halmstad

  Start date: 29 March 2027

  End date: 6 June 2027

  Pace of study: 50 %