000			a
999			_c30965 _d30965
008			220505b xxu||||| |||| 00| 0 eng d
020			_a9780367549893
082			_a004.0151 _bFOR
100			_aFortney, Jon Pierre
245			_aDiscrete mathematics for computer science : an example-based introduction
260			_bChapman and Hall/CRC, _c2022 _aBoca Raton :
300			_axii,257 p. ; _bill., _c25 cm
365			_b52.99 _cGBP _d104.80
504			_aIncludes bibliographical references and index.
520			_a"Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features designed to be especially useful for courses at the community college level Ideal as a first or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers. Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode. An appendix on basic circuit design provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers".
650			_aComputer science
650			_aDiscrete mathematics
650			_aMathematics
650			_aAlgorithm
650			_aCodomain
650			_a DeMorgan's laws
650			_a Duality principle
650			_aEuler path
650			_aHexadecimal numbers
650			_aLoop controls
650			_aPseudocode
650			_aSpanning tree
650			_a Truth table
650			_aVertex
650			_aWeighted graph
650			_aXnor gate
942			_2ddc _cBK