Discrete Mathematics I


Introduction to mathematical logic: Propositional logic, propositional calculus, formal proofs. Proof Techniques: Contraposition, Αντιθετοαναστροφή, contradictions, mathematical induction. Sets, relations, functions: Set operations and their properties, inclusion-exclusion principle, one-to-one / onto functions. Equivalence relations, order relations, extreme points and bounds. Asymptotic behavior of functions. Countability: Finite / infinite sets, pigeonhole principle, Russell’s paradox, Cantor’s diagonalization method. Counting: Addition/multiplication rule, permutations and orderings, balls-into-bins, choice of unordered collections of with/without repetition. Discrete probability: Discrete sample space, event, conditional probability, Bayes rule, expected value of variable.

Objectives

Prerequisites

Syllabus

COURSE DETAILS

Level:

Type:

Undergraduate

(A-)

Instructors: Spyridon Kontogianis
Department: Department of Computer Science & Engineering
Institution: University of Ioannina
Subject: Computer Science, Information Technology, Telecommunications
Rights: CC BY-NC-ND

Visit Course Page

SHARE THIS COURSE
RELATED COURSES

,
Eastern Macedonia and Thrace Institute of Technologie

VASSILIS
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Konstandinos Randos
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Ioannis Chalamanis
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Dimitrios Katevas
Eastern Macedonia and Thrace Institute of Technologie
COMPUTER AND INFORMATICS ENGINEERING

Dimitrios Pogaridis
Eastern Macedonia and Thrace Institute of Technologie
COMPUTER AND INFORMATICS ENGINEERING

espa en
GUnet

© Copyright 2016 - GUnet