2003, ISBN: 1111062625

Gebundene Ausgabe

[SR: 3033966], Paperback, [EAN: 9781111062620], Cengage Custom Publishing, Cengage Custom Publishing, Book, [PU: Cengage Custom Publishing], Cengage Custom Publishing, Key Details Author … Mehr…

[SR: 3033966], Paperback, [EAN: 9781111062620], Cengage Custom Publishing, Cengage Custom Publishing, Book, [PU: Cengage Custom Publishing], Cengage Custom Publishing, Key Details Author Kenneth H. Rosen Number Of Pages 928 pages Format Hardcover Publication Date 2002-09-09 Language English Publisher McGraw-Hill Higher Education Additional Details Edition Number 5 Copyright Date 2003 Illustrated Yes Dimensions Weight 29.6 Oz Height 1.4 In. Width 8.3 In. Length 10.3 In. Table Of Content Table Of Content Discrete Mathematics and Its Applications, Fifth Edition 1 The Foundations: Logic and Proof, Sets, and Functions 1.1 Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers 1.5 Methods of Proof 1.6 Sets 1.7 Set Operations 1.8 Functions 2 The Fundamentals: Algorithms, the Integers, and Matrices 2.1 Algorithms 2.2 The Growth of Functions 2.3 Complexity of Algorithms 2.4 The Integers and Division 2.5 Applications of Number Theory 2.6 Matrices 3 Mathematical Reasoning, Induction, and Recursion 3.1 Proof Strategy 3.2 Sequences and Summations 3.3 Mathematical Induction 3.4 Recursive Definitions and Structural Induction 3.5 Recursive Algorithms 3.6 Program Correctness 4 Counting 4.1 The Basics of Counting 4.2 The Pigeonhole Principle 4.3 Permutations and Combinations 4.4 Binomial Coefficients 4.5 Generalized Permutations and Combinations 4.6 Generating Permutations and Combinations 5 Discrete Probability 5.1 An Introduction to Discrete Probability 5.2 Probability Theory 5.3 Expected Value and Variance 6 Advanced Counting Techniques 6.1 Recurrence Relations 6.2 Solving Recurrence Relations 6.3 Divide-and-Conquer Algorithms and Recurrence Relations 6.4 Generating Functions 6.5 Inclusion-Exclusion 6.6 Applications of Inclusion-Exclusion 7 Relations 7.1 Relations and Their Properties 7.2 n-ary Relations and Their Applications 7.3 Representing Relations 7.4 Closures of Relations 7.5 Equivalence Relations 7.6 Partial Orderings 8 Graphs 8.1 Introduction to Graphs 8.2 Graph Terminology 8.3 Representing Graphs and Graph Isomorphism 8.4, 1000, Subjects, 1, Arts & Photography, 2, Biographies & Memoirs, 3, Business & Money, 3248857011, Calendars, 4, Children's Books, 12290, Christian Books & Bibles, 4366, Comics & Graphic Novels, 5, Computers & Technology, 6, Cookbooks, Food & Wine, 48, Crafts, Hobbies & Home, 8975347011, Education & Teaching, 173507, Engineering & Transportation, 301889, Gay & Lesbian, 10, Health, Fitness & Dieting, 9, History, 86, Humor & Entertainment, 10777, Law, 17, Literature & Fiction, 173514, Medical Books, 18, Mystery, Thriller & Suspense, 20, Parenting & Relationships, 3377866011, Politics & Social Sciences, 21, Reference, 22, Religion & Spirituality, 23, Romance, 75, Science & Math, 25, Science Fiction & Fantasy, 4736, Self-Help, 26, Sports & Outdoors, 28, Teen & Young Adult, 27, Travel, 283155, Books<

2003, ISBN: 1111062625

Key DetailsAuthor Kenneth H. RosenNumber Of Pages 928 pagesFormat HardcoverPublication Date 2002-09-09Language EnglishPublisher McGraw-Hill Higher EducationAdditional DetailsEdition Numbe… Mehr…

Key DetailsAuthor Kenneth H. RosenNumber Of Pages 928 pagesFormat HardcoverPublication Date 2002-09-09Language EnglishPublisher McGraw-Hill Higher EducationAdditional DetailsEdition Number 5Copyright Date 2003Illustrated YesDimensionsWeight 29.6 OzHeight 1.4 In.Width 8.3 In.Length 10.3 In.Table Of ContentTable Of Content Discrete Mathematics and Its Applications, Fifth Edition 1 The Foundations: Logic and Proof, Sets, and Functions 1.1 Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers 1.5 Methods of Proof 1.6 Sets 1.7 Set Operations 1.8 Functions 2 The Fundamentals: Algorithms, the Integers, and Matrices 2.1 Algorithms 2.2 The Growth of Functions 2.3 Complexity of Algorithms 2.4 The Integers and Division 2.5 Applications of Number Theory 2.6 Matrices 3 Mathematical Reasoning, Induction, and Recursion 3.1 Proof Strategy 3.2 Sequences and Summations 3.3 Mathematical Induction 3.4 Recursive Definitions and Structural Induction 3.5 Recursive Algorithms 3.6 Program Correctness 4 Counting 4.1 The Basics of Counting 4.2 The Pigeonhole Principle 4.3 Permutations and Combinations 4.4 Binomial Coefficients 4.5 Generalized Permutations and Combinations 4.6 Generating Permutations and Combinations 5 Discrete Probability 5.1 An Introduction to Discrete Probability 5.2 Probability Theory 5.3 Expected Value and Variance 6 Advanced Counting Techniques 6.1 Recurrence Relations 6.2 Solving Recurrence Relations 6.3 Divide-and-Conquer used books,books Books, Cengage Custom Publishing<

ISBN: 9781111062620

Cengage Custom Publishing. Paperback. POOR. Noticeably used book. Heavy wear to cover. Pages contain marginal notes, underlining, and or highlighting. Possible ex library copy, with all… Mehr…

Cengage Custom Publishing. Paperback. POOR. Noticeably used book. Heavy wear to cover. Pages contain marginal notes, underlining, and or highlighting. Possible ex library copy, with all the markings/stickers of that library. Accessories such as CD, codes, toys, and dust jackets may not be included., Cengage Custom Publishing<

ISBN: 9781111062620

Cengage Custom Publishing. Paperback. POOR. Acceptable copy with heavy wear to cover and pages. Pages have writing and or highlighting. Might be an ex-library copy and not include CD or… Mehr…

Cengage Custom Publishing. Paperback. POOR. Acceptable copy with heavy wear to cover and pages. Pages have writing and or highlighting. Might be an ex-library copy and not include CD or accessories., Cengage Custom Publishing<