Start

Discrete Mathematics for Programmers

Discrete Mathematics for Programmers

Mathematics

This course covers mathematical notation and methods including basic logic, set theory, combinatorics, sequences, summation notation, and factorials. It delves into elementary number theory topics like divisibility, prime numbers, the division algorithm, number bases, Euclid's algorithm, and modular arithmetic. It introduces graph theory, including elementary relationships and trees, and discusses some graph algorithms such as spanning trees. Additionally, it explores relations and fundamental concepts in function theory like injectivity, surjectivity, invertibility, and composition, especially for discrete functions.

  • Points: 7.5
  • Level: A
  • Complete: 2024
  • Grade: A
See courseplan