Schaum's Outline of Discrete Mathematics, Fourth Edition. (Record no. 298)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 08301nam a22004693i 4500 |
| 001 - CONTROL NUMBER | |
| control field | EBC6798110 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | MiAaPQ |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240909151854.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS | |
| fixed length control field | m o d | |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr cnu|||||||| |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240909s2021 xx o ||||0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781264258819 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Canceled/invalid ISBN | 9781264258802 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (MiAaPQ)EBC6798110 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (Au-PeEL)EBL6798110 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)1285170988 |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | MiAaPQ |
| Language of cataloging | eng |
| Description conventions | rda |
| -- | pn |
| Transcribing agency | MiAaPQ |
| Modifying agency | MiAaPQ |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | BC135 .L577 2022 |
| 082 0# - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 512.02 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Lipschutz, Seymour. |
| 245 10 - TITLE STATEMENT | |
| Title | Schaum's Outline of Discrete Mathematics, Fourth Edition. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 4th ed. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | New York : |
| Name of producer, publisher, distributor, manufacturer | McGraw-Hill Education, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2021. |
| 264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Date of production, publication, distribution, manufacture, or copyright notice | �2022. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource (727 pages) |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Cover -- Title Page -- Copyright Page -- Preface -- Contents -- CHAPTER 1 Set Theory -- 1.1 Introduction -- 1.2 Sets and Elements, Subsets -- 1.3 Venn Diagrams -- 1.4 Set Operations -- 1.5 Algebra of Sets, Duality -- 1.6 Finite Sets, Counting Principle -- 1.7 Classes of Sets, Power Sets, Partitions -- 1.8 Mathematical Induction -- Solved Problems -- Supplementary Problems -- CHAPTER 2 Relations -- 2.1 Introduction -- 2.2 Product Sets -- 2.3 Relations -- 2.4 Pictorial Representatives of Relations -- 2.5 Composition of Relations -- 2.6 Types of Relations -- 2.7 Closure Properties -- 2.8 Equivalence Relations -- 2.9 Partial Ordering Relations -- Solved Problems -- Supplementary Problems -- CHAPTER 3 Functions and Algorithms -- 3.1 Introduction -- 3.2 Functions -- 3.3 One-to-One, Onto, and Invertible Functions -- 3.4 Mathematical Functions, Exponential and Logarithmic Functions -- 3.5 Sequences, Indexed Classes of Sets -- 3.6 Recursively Defined Functions -- 3.7 Cardinality -- 3.8 Algorithms and Functions -- 3.9 Complexity of Algorithms -- Solved Problems -- Supplementary Problems -- CHAPTER 4 Logic and Propositional Calculus -- 4.1 Introduction -- 4.2 Propositions and Compound Statements -- 4.3 Basic Logical Operations -- 4.4 Propositions and Truth Tables -- 4.5 Tautologies and Contradictions -- 4.6 Logical Equivalence -- 4.7 Algebra of Propositions -- 4.8 Conditional and Biconditional Statements -- 4.9 Arguments -- 4.10 Propositional Functions, Quantifiers -- 4.11 Negation of Quantified Statements -- Solved Problems -- Supplementary Problems -- CHAPTER 5 Counting: Permutations and Combinations -- 5.1 Introduction -- 5.2 Basic Counting Principles -- 5.3 Mathematical Functions -- 5.4 Permutations -- 5.5 Combinations -- 5.6 The Pigeonhole Principle -- 5.7 The Inclusion-Exclusion Principle -- 5.8 Tree Diagrams -- Solved Problems. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Supplementary Problems -- CHAPTER 6 Advanced Counting Techniques, Recursion -- 6.1 Introduction -- 6.2 Combinations with Repetitions -- 6.3 Ordered and Unordered Partitions -- 6.4 Inclusion-Exclusion Principle Revisited -- 6.5 Pigeonhole Principle Revisited -- 6.6 Recurrence Relations -- 6.7 Linear Recurrence Relations with Constant Coefficients -- 6.8 Solving Second-Order Homogeneous Linear Recurrence Relations -- 6.9 Solving General Homogeneous Linear Recurrence Relations -- Solved Problems -- Supplementary Problems -- CHAPTER 7 Discrete Probability Theory -- 7.1 Introduction -- 7.2 Sample Space and Events -- 7.3 Finite Probability Spaces -- 7.4 Conditional Probability -- 7.5 Independent Events -- 7.6 Independent Repeated Trials, Binomial Distribution -- 7.7 Random Variables -- 7.8 Chebyshev's Inequality, Law of Large Numbers -- Solved Problems -- Supplementary Problems -- CHAPTER 8 Graph Theory -- 8.1 Introduction, Data Structures -- 8.2 Graphs and Multigraphs -- 8.3 Subgraphs, Isomorphic and Homeomorphic Graphs -- 8.4 Paths, Connectivity -- 8.5 Traversable and Eulerian Graphs, Bridges of K�onigsberg -- 8.6 Labeled and Weighted Graphs -- 8.7 Complete, Regular, and Bipartite Graphs -- 8.8 Tree Graphs -- 8.9 Planar Graphs -- 8.10 Graph Colorings -- 8.11 Representing Graphs in Computer Memory -- 8.12 Graph Algorithms -- 8.13 Traveling-Salesman Problem -- Solved Problems -- Supplementary Problems -- CHAPTER 9 Directed Graphs -- 9.1 Introduction -- 9.2 Directed Graphs -- 9.3 Basic Definitions -- 9.4 Rooted Trees -- 9.5 Sequential Representation of Directed Graphs -- 9.6 Warshall's Algorithm, Shortest Paths -- 9.7 Linked Representation of Directed Graphs -- 9.8 Graph Algorithms: Depth-First and Breadth-First Searches -- 9.9 Directed Cycle-Free Graphs, Topological Sort -- 9.10 Pruning Algorithm for Shortest Path -- Solved Problems. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Supplementary Problems -- CHAPTER 10 Binary Trees -- 10.1 Introduction -- 10.2 Binary Trees -- 10.3 Complete and Extended Binary Trees -- 10.4 Representing Binary Trees in Memory -- 10.5 Traversing Binary Trees -- 10.6 Binary Search Trees -- 10.7 Priority Queues, Heaps -- 10.8 Path Lengths, Huffman's Algorithm -- 10.9 General (Ordered Rooted) Trees Revisited -- Solved Problems -- Supplementary Problems -- CHAPTER 11 Properties of the Integers -- 11.1 Introduction -- 11.2 Order and Inequalities, Absolute Value -- 11.3 Mathematical Induction -- 11.4 Division Algorithm -- 11.5 Divisibility, Primes -- 11.6 Greatest Common Divisor, Euclidean Algorithm -- 11.7 Fundamental Theorem of Arithmetic -- 11.8 Congruence Relation -- 11.9 Congruence Equations -- Solved Problems -- Supplementary Problems -- CHAPTER 12 Languages, Automata, Grammars -- 12.1 Introduction -- 12.2 Alphabet, Words, Free Semigroup -- 12.3 Languages -- 12.4 Regular Expressions, Regular Languages -- 12.5 Finite State Automata -- 12.6 Grammars -- Solved Problems -- Supplementary Problems -- CHAPTER 13 Finite State Machines and Turing Machines -- 13.1 Introduction -- 13.2 Finite State Machines -- 13.3 G�odel Numbers -- 13.4 Turing Machines -- 13.5 Computable Functions -- Solved Problems -- Supplementary Problems -- CHAPTER 14 Ordered Sets and Lattices -- 14.1 Introduction -- 14.2 Ordered Sets -- 14.3 Hasse Diagrams of Partially Ordered Sets -- 14.4 Consistent Enumeration -- 14.5 Supremum and Infimum -- 14.6 Isomorphic (Similar) Ordered Sets -- 14.7 Well-Ordered Sets -- 14.8 Lattices -- 14.9 Bounded Lattices -- 14.10 Distributive Lattices -- 14.11 Complements, Complemented Lattices -- Solved Problems -- Supplementary Problems -- CHAPTER 15 Boolean Algebra -- 15.1 Introduction -- 15.2 Basic Definitions -- 15.3 Duality -- 15.4 Basic Theorems -- 15.5 Boolean Algebras as Lattices. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 15.6 Representation Theorem -- 15.7 Sum-of-Products Form for Sets -- 15.8 Sum-of-Products Form for Boolean Algebras -- 15.9 Minimal Boolean Expressions, Prime Implicants -- 15.10 Logic Gates and Circuits -- 15.11 Truth Tables, Boolean Functions -- 15.12 Karnaugh Maps -- Solved Problems -- Supplementary Problems -- APPENDIX A Vectors and Matrices -- A.1 Introduction -- A.2 Vectors -- A.3 Matrices -- A.4 Matrix Addition and Scalar Multiplication -- A.5 Matrix Multiplication -- A.6 Transpose -- A.7 Square Matrices -- A.8 Invertible (Nonsingular) Matrices, Inverses -- A.9 Determinants -- A.10 Elementary Row Operations, Gaussian Elimination (Optional) -- A.11 Boolean (Zero-One) Matrices -- Solved Problems -- Supplementary Problems -- APPENDIX B Algebraic Systems -- B.1 Introduction -- B.2 Operations -- B.3 Semigroups -- B.4 Groups -- B.5 Subgroups, Normal Subgroups, and Homomorphisms -- B.6 Rings, Integral Domains, and Fields -- B.7 Polynomials Over a Field -- Solved Problems -- Supplementary Problems -- Index. |
| 588 ## - SOURCE OF DESCRIPTION NOTE | |
| Source of description note | Description based on publisher supplied metadata and other sources. |
| 590 ## - LOCAL NOTE (RLIN) | |
| Local note | Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Logic, Symbolic and mathematical. |
| 655 #4 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Lipson, Marc. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Print version: |
| Main entry heading | Lipschutz, Seymour |
| Title | Schaum's Outline of Discrete Mathematics, Fourth Edition |
| Place, publisher, and date of publication | New York : McGraw-Hill Education,c2021 |
| International Standard Book Number | 9781264258802 |
| 797 2# - LOCAL ADDED ENTRY--CORPORATE NAME (RLIN) | |
| Corporate name or jurisdiction name as entry element | ProQuest (Firm) |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://ebookcentral.proquest.com/lib/ppks/detail.action?docID=6798110">https://ebookcentral.proquest.com/lib/ppks/detail.action?docID=6798110</a> |
| Public note | Click to View |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Library of Congress Classification |
| Koha item type | E-Book |
No items available.