MARC details
| 000 -LEADER |
|---|
| fixed length control field |
04571nam a2200253Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520100613.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780071615860 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 162 .L57 2007 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Lipschutz, Seymour. |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Schaum's outline of discrete mathematics / |
| Statement of responsibility, etc. |
Seymour Lipschutz and Marc Lipson |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Third edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
New York : |
| Name of publisher, distributor, etc. |
McGraw Hill Education, |
| Date of publication, distribution, etc. |
c2007 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xi, 474 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
28 cm. |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD12.97 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Cover Page -- SCHAUM'S outlines Discrete Mathematics -- 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 Techniques of Counting -- 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 -- 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 Probability -- 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├╢nigsberg |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills. This Schaum's Outline gives you: Practice problems with full explanations that reinforce knowledge Coverage of the most up-to-date developments in your course field In-depth review of practices and applications Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores! Schaum's Outlines-Problem Solved. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
ALGEBRA ,ABSTRACT -- OUTLINES, SYLLABI, ETC |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Lipson, Marc |
| Relator term |
co-author |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
