Discrete mathematics for computer science / edited by Prof. Pomde N.P.
Material type:
TextPublisher: Burlington, ON : Arcler Press, c2024Description: ix, 223 pages : color illustrationsContent type: text Media type: unmediated Carrier type: volumeISBN: 9781774698303 [hardbound]Subject(s): Computer science -- Mathematics| Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Subject Reference
|
College Annex Library Subject Reference | 004.0151 D63 2024 (Browse shelf) | Available | 3UCBL000028694 |
Browsing College Annex Library shelves, Shelving location: Subject Reference Close shelf browser
|
|
|
|
|
|
|
||
| 001.6424 G86 2024 Professional C++ / | 003 D42 2022 Systems analysis and design / | 004 C73 2024 Computer systems application / | 004.0151 D63 2024 Discrete mathematics for computer science / | 004.072 Oa8 2022 Researching information systems and computing / | 004.165 Ad95 2022 Advanced microprocessor / edited by Nidhi Chopra. | 004.22 G64 2023 Guide to computer processor architecture : a RISC-V approach, with high-level synthesis / |
Includes bibliographical references and index.
Contents: 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.
"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
Adult
Brigoli, Darlyne College of Computer Engineering Computer Engineering
Text in English
There are no comments on this title.