Discrete Mathematics I


Discrete Mathematics I course includes combinatorics, generating functions, recurrence relations, Polya enumeration theorem and Inclusion - Exclusion principle

Objectives

combinatorics, generating functions, recurrence relations, Polya enumeration theorem and Inclusion - Exclusion principle

Prerequisites

Mathematical analysis

Syllabus

combinatorics, generating functions, recurrence relations, Polya enumeration theorem and Inclusion - Exclusion principle

COURSE DETAILS

Level:

Type:

Undergraduate

(A+)

Instructors: Christos Bouras
Department: Computer Engineering and Informatics Department
Institution: University of Patras
Subject: Computer and Electronic Engineering
Rights: CC - Attribution-NonCommercial-NoDerivatives

Visit Course Page

SHARE THIS COURSE
RELATED COURSES

George Stephanides
University of Macedonia
Applied Informatics

Petros Stefaneas
National Technical University of Athens
School of Applied Mathematical and Physical Science

Spyridon Kontogianis
University of Ioannina
Department of Computer Science & Engineering

Evi Papaioannou
University of Patras
Department of Cultural Heritage Management and New Technologies

Konstantinos Stergiou
University of Western Macedonia
Informatics and Telecommunications Engineering

Aggelos Kiayias
National and Kapodistrian University of Athens
Department of Informatics and Telecommunications

espa en
GUnet

© Copyright 2016 - GUnet