# Discrete mathematics for computer science : (Record no. 1179)

[ view plain ]

000 -LEADER | |
---|---|

fixed length control field | 02386nam a22001817a 4500 |

005 - DATE AND TIME OF LATEST TRANSACTION | |

control field | 20211115084307.0 |

008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |

fixed length control field | 211115b ||||| |||| 00| 0 eng d |

020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |

International Standard Book Number | 9780367549893 |

040 ## - CATALOGING SOURCE | |

Transcribing agency | KCST |

082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |

Classification number | 004.0151 |

Item number | Fo Di |

100 ## - MAIN ENTRY--PERSONAL NAME | |

Personal name | Fortney, Jon Pierre |

9 (RLIN) | 5532 |

245 ## - TITLE STATEMENT | |

Title | Discrete mathematics for computer science : |

Remainder of title | an example-based introduction / |

Statement of responsibility, etc. | Jon Pierre Fortney |

260 ## - PUBLICATION, DISTRIBUTION, ETC. | |

Place of publication, distribution, etc. | Boca Raton: |

Name of publisher, distributor, etc. | CRC Press, a Chapman & Hall Book; |

Date of publication, distribution, etc. | 2021. |

300 ## - PHYSICAL DESCRIPTION | |

Extent | 257 p. |

505 ## - FORMATTED CONTENTS NOTE | |

Formatted contents note | 1. Introduction to Algorithms. 1.1. What are Algorithms? 1.2. Control Structures. 1.3. Tracing an Algorithm. 1.4. Algorithm Examples. 1.5. Problems. 2. Number Representations. 2.1. Whole Numbers. 2.2. Fractional Numbers. 2.3. The Relationship Between Binary, Octal, and Hexadecimal Numbers. 2.4. Converting from Decimal Numbers. 2.5. Problems. 3. Logic. 3.1. Propositions and Connectives. 3.2. Connective Truth Tables. 3.3. Truth Value of Compound Statements. 3.4. Tautologies and Contradictions. 3.5. Logical Equivalence and The Laws of Logic. 3.6 Problems. 4. Set Theory. 4.1. Set Notation. 4.2. Set Operations. 4.3. Venn Diagrams. 4.4. The Laws of Set Theory. 4.5. Binary Relations on Sets. 4.6. Problems. 5. Boolean Algebra. 5.1. Definition of Boolean Algebra. 5.2. Logic and Set Theory as Boolean Algebras. 5.3. Digital Circuits. 5.4. Sums-of-Products and Products-of-Sums. 5.5. Problems. 6. Functions. 6.1. Introduction to Functions. 6.2. Real-valued Functions. 6.3. Function Composition and Inverses. 6.4. Problems. 7. Counting and Combinatorics. 7.1. Addition and Multiplication Principles. 7.2. Counting Algorithm Loops. 7.3. Permutations and Arrangements. 7.4. Combinations and Subsets. 7.5. Permutation and Combination Examples. 7.6. Problems. 8. Algorithmic Complexity. 8.1. Overview of Algorithmic Complexity. 8.2. Time-Complexity Functions. 8.3. Finding Time-Complexity Functions. 8.4. Big-O Notation. 8.5. Ranking Algorithms. 8.6. Problems. 9. Graph Theory. 9.1. Basic Definitions. 9.2. Eulerian and Semi-Eulerian Graphs. 9.3. Matrix representation of Graphs. 9.4. Reachability for Directed Graphs. 9.5. Problems. 10. Trees. 10.1 Basic Definitions. 10.2. Minimal Spanning Trees of Weighted Graphs. 10.3. Minimal Distance Paths. 10.4. Problems. Appendix A: Basic Circuit Design. Appendix B: Answers to Problems. |

650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |

Topical term or geographic name entry element | Computer science |

Form subdivision | Mathematics. |

9 (RLIN) | 4778 |

942 ## - ADDED ENTRY ELEMENTS (KOHA) | |

Source of classification or shelving scheme | |

Koha item type | Book |

Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Permanent Location | Current Location | Date acquired | Full call number | Barcode | Date last seen | Cost, replacement price | Price effective from | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|

KCST Library | KCST Library | 2021-11-15 | 004.0151 Fo Di | 1000000982 | 2021-11-15 | 17.20 | 2021-11-15 | Book |