000			nam a22 7a 4500
999			_c29509 _d29509
008			190528b xxu||||| |||| 00| 0 eng d
020			_a9780691179292
082			_a004.0151 _bLEW
100			_aLewis, Harry R.
245			_aEssential discrete mathematics for computer science
260			_aPrinceton _bPrinceton University Press _c2019
300			_axii, 388 p. _bill. _c26 cm
365			_aUSD _b75 _d77.90
504			_aIncludes bibliographical references and index.
520			_aDiscrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises.
650			_aComputer science
650			_aMathematics
650			_aBayes'theorem
650			_aDAG (directed acyclic graph)
650			_aEuclid's algorithm
650			_aInclusion -Exclusion Principle
650			_aKaratsuba's algorithm
650			_aMenger's theorem
650			_aSimpson's paradox
650			_aCrypography
710			_aZax, Rachel
942			_2ddc _cBK