Discrete Mathematics


This class is an introduction solving counting and structural problems. In the first section we see several examples of typical combinatorial problems. Also providing basic information on sets, proof techniques, enumeration.. In the next few sections of the class, we explore enumerative ideas, including the pigeonhole principle and inclusion/exclusion. At the end we study enumerative functions and the relations between them.

Objectives

Student familiarization with the general principles of the enumerative combinatorics, like counting combinations and counting permutations and the applications of combinatorics in computer science.

Prerequisites

Algebraic Structures Basic Set Theory Basic definitions about functions

Syllabus

Combinations, Permutations , Penguin principle , Generating functions , Propositional Calculus, Boolean Algebras

COURSE DETAILS

Level:

Type:

Undergraduate

(A-)

Instructors: Petros Stefaneas
Department: School of Applied Mathematical and Physical Science
Institution: National Technical University of Athens
Subject: Mathematics
Rights: CC - Attribution-NonCommercial-ShareAlike

Visit Course Page

SHARE THIS COURSE
RELATED COURSES

Christos Bouras
University of Patras
Computer Engineering and Informatics Department

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

Konstantinos Stergiou
University of Western Macedonia
Informatics and Telecommunications Engineering

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

George Stephanides
University of Macedonia
Applied Informatics

Spyridon Kontogianis
University of Ioannina
Department of Computer Science & Engineering

espa en
GUnet

© Copyright 2016 - GUnet