Conducted in
terms:
Winter Semester 2010/11
Winter Semester 2011/12
Winter Semester 2012/13
Winter Semester 2013/14
Winter Semester 2010/11
Winter Semester 2011/12
Winter Semester 2012/13
Winter Semester 2013/14
ECTS credits:
4
Organized by:
Faculty of Mechanical Engineering
Discrete Mathematics MARSO3018A
Course content:
Rules of counting.
Scheme of selection.
Placement of putting in order.
Recursive. Solving of recursions.
Z-transform and its applications. Discrete convolution.
Graphs, matrix representation of graphs. Classification of graphs.
Serching in graphs.
Euler's and Hamilton's graphs.
Counting of graphs. Coloring of graphs.
Learning outcomes: ability of basic konwledge of combinatorics and graphs in engeneering problems.
(in Polish) Rodzaj przedmiotu
(in Polish) Obowiązkowy
Course coordinators
Bibliography
a) basic references:
1. J.Kulikowski, Discrete mathematics
2. G.Schmidt, T.Strohlein. Relations and graphs : discrete mathematics for computer scientists
b) supplementary references: