000			03098nam a22003137a 4500
003			OSt
005			20250526091605.0
008			250408b |||||||| |||| 00| 0 eng d
020			_a9781774698303 [hardbound]
040			_aUniversity of Cebu-Banilad _cUniversity of Cebu-Banilad
245			_aDiscrete mathematics for computer science / _cedited by Prof. Pomde N.P.
260			_aBurlington, ON : _bArcler Press, _cc2024.
300			_aix, 223 pages : _bcolor illustrations ;
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
338			_2rdacarrier _avolume
504			_aIncludes bibliographical references and index.
505			_aContents: Chapter 1 Mathematical logic and proofs -- Chapter 2 Basic mathematics on the real numbers -- Chapter 3 Fundamental mathematical objects -- Chapter 4 Modular arithmetic and polynomials -- Chapter 5 Mathematical functions -- Chapter 6 Linear algebra in mathematics -- Chapter 7 Mathematical graphs -- Chapter 8 Mathematical counting and combinatorics -- Chapter 9 Discrete probability in mathematics -- Chapter 10 Recurrence relations.
520			_a"This book discusses the role of proofs in mathematics and computer science. In mathematics, a proof involves validating a proposition through logical deductions from axioms. Computer scientists focus on demonstrating program accuracy, given the increasing error susceptibility of software. A community of specialists aims to enhance program precision, extending to verifying computer processor chips for leading manufacturers. Creating mathematical models to affirm program validity is an active study area. A proof, in this context, involves a sequence of logical deductions from axioms and established statements, leading to the desired proposition. While crafting proofs may seem daunting, standard templates offer a framework. Some templates can be interconnected, providing both high-level structure and detailed guidance. The Principle of Mathematical Induction is applied to validate algorithms without computer reliance. Sets underpin modern mathematics and software engineering, introduced with language and typical tasks. Primary set operations' understanding enables proof techniques for functions, relations, and graphs, validating algorithms for specific tasks. The book delves into language describing element collections and sets, providing proof templates for comprehension and construction. The book covers common set operations, introduces additional proof templates, and addresses numbering elements and the Principle of Mathematical Induction. This exploration deepens the understanding of mathematical proofs and their role in computer science applications." --Provided by the publisher
521			_aAdult
541			_xBrigoli, Darlyne _yCollege of Computer Engineering _zComputer Engineering
546			_aText in English
650			_aComputer science _xMathematics.
700			_aN.P, Pomde, _eeditor.
942			_2ddc _cBK
998			_cadryann[new] _d04/08/2025
998			_cJanna [edited] _d04/10/2025
999			_c13468 _d13468