Discrete mathematics / (Record no. 8015)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06725nam a22002057a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20231113092301.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 231113b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781264258802 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | KCST |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Item number | Li Di |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Lipschutz, Seymour |
| 9 (RLIN) | 4863 |
| 245 ## - TITLE STATEMENT | |
| Title | Discrete mathematics / |
| Statement of responsibility, etc. | Seymour Lipschutz, Marc Lipson |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 4th |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | New York: |
| Name of publisher, distributor, etc. | McGraw-Hill; |
| Date of publication, distribution, etc. | 2022. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 472 p. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | <br/>Cover<br/>Title Page<br/>Copyright Page<br/>Preface<br/>Contents<br/>CHAPTER 1 Set Theory<br/>1.1 Introduction<br/>1.2 Sets and Elements, Subsets<br/>1.3 Venn Diagrams<br/>1.4 Set Operations<br/>1.5 Algebra of Sets, Duality<br/>1.6 Finite Sets, Counting Principle<br/>1.7 Classes of Sets, Power Sets, Partitions<br/>1.8 Mathematical Induction<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 2 Relations<br/>2.1 Introduction<br/>2.2 Product Sets<br/>2.3 Relations<br/>2.4 Pictorial Representatives of Relations<br/>2.5 Composition of Relations<br/>2.6 Types of Relations<br/>2.7 Closure Properties<br/>2.8 Equivalence Relations<br/>2.9 Partial Ordering Relations<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 3 Functions and Algorithms<br/>3.1 Introduction<br/>3.2 Functions<br/>3.3 One-to-One, Onto, and Invertible Functions<br/>3.4 Mathematical Functions, Exponential and Logarithmic Functions<br/>3.5 Sequences, Indexed Classes of Sets<br/>3.6 Recursively Defined Functions<br/>3.7 Cardinality<br/>3.8 Algorithms and Functions<br/>3.9 Complexity of Algorithms<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 4 Logic and Propositional Calculus<br/>4.1 Introduction<br/>4.2 Propositions and Compound Statements<br/>4.3 Basic Logical Operations<br/>4.4 Propositions and Truth Tables<br/>4.5 Tautologies and Contradictions<br/>4.6 Logical Equivalence<br/>4.7 Algebra of Propositions<br/>4.8 Conditional and Biconditional Statements<br/>4.9 Arguments<br/>4.10 Propositional Functions, Quantifiers<br/>4.11 Negation of Quantified Statements<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 5 Counting: Permutations and Combinations<br/>5.1 Introduction<br/>5.2 Basic Counting Principles<br/>5.3 Mathematical Functions<br/>5.4 Permutations<br/>5.5 Combinations<br/>5.6 The Pigeonhole Principle<br/>5.7 The Inclusion-Exclusion Principle<br/>5.8 Tree Diagrams<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 6 Advanced Counting Techniques, Recursion<br/>6.1 Introduction<br/>6.2 Combinations with Repetitions<br/>6.3 Ordered and Unordered Partitions<br/>6.4 Inclusion-Exclusion Principle Revisited<br/>6.5 Pigeonhole Principle Revisited<br/>6.6 Recurrence Relations<br/>6.7 Linear Recurrence Relations with Constant Coefficients<br/>6.8 Solving Second-Order Homogeneous Linear Recurrence Relations<br/>6.9 Solving General Homogeneous Linear Recurrence Relations<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 7 Discrete Probability Theory<br/>7.1 Introduction<br/>7.2 Sample Space and Events<br/>7.3 Finite Probability Spaces<br/>7.4 Conditional Probability<br/>7.5 Independent Events<br/>7.6 Independent Repeated Trials, Binomial Distribution<br/>7.7 Random Variables<br/>7.8 Chebyshev's Inequality, Law of Large Numbers<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 8 Graph Theory<br/>8.1 Introduction, Data Structures<br/>8.2 Graphs and Multigraphs<br/>8.3 Subgraphs, Isomorphic and Homeomorphic Graphs<br/>8.4 Paths, Connectivity<br/>8.5 Traversable and Eulerian Graphs, Bridges of K?nigsberg<br/>8.6 Labeled and Weighted Graphs<br/>8.7 Complete, Regular, and Bipartite Graphs<br/>8.8 Tree Graphs<br/>8.9 Planar Graphs<br/>8.10 Graph Colorings<br/>8.11 Representing Graphs in Computer Memory<br/>8.12 Graph Algorithms. 8.13 Traveling-Salesman Problem<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 9 Directed Graphs<br/>9.1 Introduction<br/>9.2 Directed Graphs<br/>9.3 Basic Definitions<br/>9.4 Rooted Trees<br/>9.5 Sequential Representation of Directed Graphs<br/>9.6 Warshall's Algorithm, Shortest Paths<br/>9.7 Linked Representation of Directed Graphs<br/>9.8 Graph Algorithms: Depth-First and Breadth-First Searches<br/>9.9 Directed Cycle-Free Graphs, Topological Sort<br/>9.10 Pruning Algorithm for Shortest Path<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 10 Binary Trees<br/>10.1 Introduction<br/>10.2 Binary Trees<br/>10.3 Complete and Extended Binary Trees<br/>10.4 Representing Binary Trees in Memory<br/>10.5 Traversing Binary Trees<br/>10.6 Binary Search Trees<br/>10.7 Priority Queues, Heaps<br/>10.8 Path Lengths, Huffman's Algorithm<br/>10.9 General (Ordered Rooted) Trees Revisited<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 11 Properties of the Integers<br/>11.1 Introduction<br/>11.2 Order and Inequalities, Absolute Value<br/>11.3 Mathematical Induction<br/>11.4 Division Algorithm<br/>11.5 Divisibility, Primes<br/>11.6 Greatest Common Divisor, Euclidean Algorithm<br/>11.7 Fundamental Theorem of Arithmetic<br/>11.8 Congruence Relation<br/>11.9 Congruence Equations<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 12 Languages, Automata, Grammars<br/>12.1 Introduction<br/>12.2 Alphabet, Words, Free Semigroup<br/>12.3 Languages<br/>12.4 Regular Expressions, Regular Languages<br/>12.5 Finite State Automata<br/>12.6 Grammars<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 13 Finite State Machines and Turing Machines<br/>13.1 Introduction<br/>13.2 Finite State Machines<br/>13.3 G?del Numbers<br/>13.4 Turing Machines<br/>13.5 Computable Functions<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 14 Ordered Sets and Lattices<br/>14.1 Introduction<br/>14.2 Ordered Sets<br/>14.3 Hasse Diagrams of Partially Ordered Sets<br/>14.4 Consistent Enumeration<br/>14.5 Supremum and Infimum<br/>14.6 Isomorphic (Similar) Ordered Sets<br/>14.7 Well-Ordered Sets<br/>14.8 Lattices<br/>14.9 Bounded Lattices<br/>14.10 Distributive Lattices<br/>14.11 Complements, Complemented Lattices<br/>Solved Problems<br/>Supplementary Problems<br/>CHAPTER 15 Boolean Algebra<br/>15.1 Introduction<br/>15.2 Basic Definitions<br/>15.3 Duality<br/>15.4 Basic Theorems<br/>15.5 Boolean Algebras as Lattices<br/>15.6 Representation Theorem<br/>15.7 Sum-of-Products Form for Sets<br/>15.8 Sum-of-Products Form for Boolean Algebras<br/>15.9 Minimal Boolean Expressions, Prime Implicants<br/>15.10 Logic Gates and Circuits<br/>15.11 Truth Tables, Boolean Functions<br/>15.12 Karnaugh Maps<br/>Solved Problems<br/>Supplementary Problems<br/>APPENDIX A Vectors and Matrices<br/>A.1 Introduction<br/>A.2 Vectors<br/>A.3 Matrices<br/>A.4 Matrix Addition and Scalar Multiplication<br/>A.5 Matrix Multiplication<br/>A.6 Transpose<br/>A.7 Square Matrices<br/>A.8 Invertible (Nonsingular) Matrices, Inverses<br/>A.9 Determinants<br/>A.10 Elementary Row Operations, Gaussian Elimination (Optional)<br/>A.11 Boolean (Zero-One) Matrices<br/>Solved Problems<br/>Supplementary Problems<br/>APPENDIX B Algebraic Systems<br/>B.1 Introduction<br/>B.2 Operations<br/>B.3 Semigroups<br/>B.4 Groups<br/>B.5 Subgroups, Normal Subgroups, and Homomorphisms<br/>B.6 Rings, Integral Domains, and Fields<br/>B.7 Polynomials Over a Field<br/>Solved Problems<br/>Supplementary Problems<br/>Index |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Discrete mathematics |
| 9 (RLIN) | 7887 |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Lipson, Marc |
| 9 (RLIN) | 4866 |
| 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 | Source of acquisition | Cost, normal purchase price | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| KCST Library | KCST Library | 2023-11-05 | Procured - KCST-INV012 | 6.15 | 004.0151 Li Di | 1000001459 | 2023-11-13 | 2023-11-13 | Book | |||||
| KCST Library | KCST Library | 2023-11-05 | Procured - KCST-INV012 | 6.15 | 004.0151 Li Di | 1000001460 | 2023-11-13 | 2023-11-13 | Book | |||||
| KCST Library | KCST Library | 2023-11-05 | Procured - KCST-INV012 | 6.15 | 004.0151 Li Di | 1000001461 | 2023-11-13 | 2023-11-13 | Book | |||||
| KCST Library | KCST Library | 2023-11-21 | Procured - KCST-INV013 | 6.15 | 004.0151 Li Di | 1000001474 | 2023-11-23 | 2023-11-13 | Book | |||||
| KCST Library | KCST Library | 2023-11-21 | Procured - KCST-INV013 | 6.15 | 004.0151 Li Di | 1000001475 | 2023-11-23 | 2023-11-13 | Book |