Embedded Files
SynopsisThis course introduces methods of discrete mathematics to students. Topics covered include: logic, arguments, sets, functions, matrices, number theory, counting techniques, pigeonhole principle, permutations and combinations, relations, graphs, Euler paths, Hamiltonian paths, trees, spanning trees and Boolean algebras.
References
Kenneth Rosen, Discrete Mathematics and Its Applications, McGraw Hill Higher Education. McGraw-Hill, 8 edition, 2019.
Oscar Levin, Discrete Mathematics: An Open Introduction, 1st edition, CreateSpace Independent Publishing Platform, 2015,
Richard Johnsonbaugh, Discrete Mathematics, 8th edition, Pearson, 2015
Google Sites
Report abuse