MATA2520 Set theory and graphs (5 cr)

Study level:
Intermediate studies
Grading scale:
0-5
Language:
English, Finnish
Responsible organisation:
Department of Mathematics and Statistics
Curriculum periods:
2024-2025, 2025-2026, 2026-2027, 2027-2028

Tweet text

Opintojakso on tarkoitettu tekniikan alan opiskelijoille ja ohjelmiin hakemista suunnitteleville, sekä tilastotieteen ja datatieteen opiskelijoille.

Description

  • Basic concepts of set theory.
  • Relations and functions, including properties of relations and equivalence classes.
  • Binary trees.
  • Undirected and directed graphs, including connected and strongly connected components.
  • Isomorphism and bisimilarity. 

Learning outcomes

After completing the course, the student:

  • Understands the Cartesian product and its connection to data structures composed of multiple parts.
  • Is familiar with the concept of a power set.
  • Can calculate the sizes of finite sets using the inclusion-exclusion principle, as well as the sizes of product sets and power sets.
  • Can use the definitions of reflexivity, symmetry, antisymmetry, and transitivity in simple reasoning regarding binary relations.
  • Masters the concepts of equivalence and order relations, as well as the relationship between equivalence classes and partitions.
  • Is familiar with the concepts of function, function composition, bijection, inverse function, injection, and surjection.
  • Is familiar with the concept of a binary tree and knows how to traverse a binary tree in pre-order, in-order, and post-order.
  • Knows the definitions of undirected and directed graphs.
  • Masters concepts related to graphs: node, edge, path, loop, cycle, connected component, and strongly connected component.
  • Has been introduced to graph isomorphism and bisimilarity, and knows their connection to equivalence classes and the behavior of computer programs.
  • Recognizes when a case involves a graph according to its formal definition versus an equivalence class of isomorphic graphs. 

Additional information

Kurssin sisältö on osittain yhtenevä seuraavien kurssien kanssa:  1) MATA140 Johdatus diskreettiin matematiikkaan,

2) Johdatus verkkoteoriaan                                                 

3) Johdatus kombinatoriikkaan

Jos sisällytät kurssin MATA2520 Joukko-oppi ja graafiteoria  matematiikan opintokokonaisuuteen, et voi sisällyttää siihen edellä mainittuja kursseja. 


Description of prerequisites

MATA2700 Proof and Deduction Methods for Engineering

Literature

  • Oscar Levin: Discrete Mathematics, An Open Introduction
  • Margaret M. Fleck: Building Blocks for Theoretical Computer Science

Completion methods

Method 1

Evaluation criteria:
Harjoitukset ja kurssitentti. Tarkemmat arviointiperusteet ilmoitetaan opetusohjelmassa.
Time of teaching:
Period 1
Select all marked parts

Method 2

Evaluation criteria:
Lopputentin pistemäärä
Select all marked parts
Parts of the completion methods
x

Participation in teaching (5 cr)

Type:
Participation in teaching
Grading scale:
0-5
Language:
English, Finnish
No published teaching
x

Exam (5 cr)

Type:
Exam
Grading scale:
0-5
Language:
English, Finnish
No published teaching