Amazon cover image
Image from Amazon.com
Image from Google Jackets
Image from OpenLibrary

Discrete mathematics / Richard Johnsonbaugh.

By: Publication details: Pearson Education Limited, 2019 Harlow, United Kingdom : Edition: Eighth edition, global editionDescription: 767p. : 27cmISBN:
  • 1292233702
  • 9781292233703
  • 9781292233727 electronic book
  • 1292233729 electronic book
Subject(s): LOC classification:
  • QA39.2  .J65 2019
Contents:
Front Cover; List of Symbols; Title Page; Copyright Page; Contents; Preface; 1 Sets and Logic; 1.1 Sets; 1.2 Propositions; 1.3 Conditional Propositions and Logical Equivalence; 1.4 Arguments and Rules of Inference; 1.5 Quantifiers; 1.6 Nested Quantifiers; Problem-Solving Corner: Quantifiers; Chapter 1 Notes; Chapter 1 Review; Chapter 1 Self-Test; Chapter 1 Computer Exercises; 2 Proofs; 2.1 Mathematical Systems, Direct Proofs, and Counterexamples; 2.2 More Methods of Proof; Problem-Solving Corner Proving Some Properties of Real Numbers; 2.3 Resolution Proofs; 2.4 Mathematical Induction.
Problem-Solving Corner Mathematical Induction2.5 Strong Form of Induction and the Well-Ordering Property; Chapter 2 Notes; Chapter 2 Review; Chapter 2 Self-Test; Chapter 2 Computer Exercises; 3 Functions, Sequences, and Relations; 3.1 Functions; Problem-Solving Corner: Functions; 3.2 Sequences and Strings; 3.3 Relations; 3.4 Equivalence Relations; Problem-Solving Corner: Equivalence Relations; 3.5 Matrices of Relations; 3.6 Relational Databases; Chapter 3 Notes; Chapter 3 Review; Chapter 3 Self-Test; Chapter 3 Computer Exercises; 4 Algorithms; 4.1 Introduction; 4.2 Examples of Algorithms.
5058 |a 4.3 Analysis of AlgorithmsProblem-Solving Corner Design and Analysis of an Algorithm; 4.4 Recursive Algorithms; Chapter 4 Notes; Chapter 4 Review; Chapter 4 Self-Test; Chapter 4 Computer Exercises; 5 Introduction to Number Theory; 5.1 Divisors; 5.2 Representations of Integers and Integer Algorithms; 5.3 The Euclidean Algorithm; Problem-Solving Corner Making Postage; 5.4 The RSA Public-Key Cryptosystem; Chapter 5 Notes; Chapter 5 Review; Chapter 5 Self-Test; Chapter 5 Computer Exercises; 6 Counting Methods and the PigeonholePrinciple; 6.1 Basic Principles; Problem-Solving Corner: Counting.
6.2 Permutations and CombinationsProblem-Solving Corner: Combinations; 6.3 Generalized Permutations and Combinations; 6.4 Algorithms for Generating Permutations and Combinations; 6.5 Introduction to Discrete Probability; 6.6 Discrete Probability Theory; 6.7 Binomial Coefficients and Combinatorial Identities; 6.8 The Pigeonhole Principle; Chapter 6 Notes; Chapter 6 Review; Chapter 6 Self-Test; Chapter 6 Computer Exercises; 7 Recurrence Relations; 7.1 Introduction; 7.2 Solving Recurrence Relations; Problem-Solving Corner Recurrence Relations; 7.3 Applications to the Analysis of Algorithms.
7.4 The Closest-Pair ProblemChapter 7 Notes; Chapter 7 Review; Chapter 7 Self-Test; Chapter 7 Computer Exercises; 8 Graph Theory; 8.1 Introduction; 8.2 Paths and Cycles; Problem-Solving Corner: Graphs; 8.3 Hamiltonian Cycles and the Traveling Salesperson Problem; 8.4 A Shortest-Path Algorithm; 8.5 Representations of Graphs; 8.6 Isomorphisms of Graphs; 8.7 Planar Graphs; 8.8 Instant Insanity; Chapter 8 Notes; Chapter 8 Review; Chapter 8 Self-Test; Chapter 8 Computer Exercises; 9 Trees; 9.1 Introduction; 9.2 Terminology and Characterizations of Trees; Problem-Solving Corner Trees.
Awards:
  • Description based on online resource; title from digital title page (viewed on January 22, 2019).
Item type: Book
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Bishop Okullu Memorial Library (Limuru Campus) General Circulation Non-fiction QA39.2 .J65 2019 (Browse shelf(Opens below)) 1 Available 066499
Nairobi Campus General Circulation Non-fiction QA39.2 .J65 2019 (Browse shelf(Opens below)) 2 Available 066500
Total holds: 0

Browsing Bishop Okullu Memorial Library (Limuru Campus) shelves,Shelving location: General Circulation,Collection: Non-fiction Close shelf browser (Hides shelf browser)

Includes bibliographical references and index.

9.3 Spanning Trees.

Front Cover; List of Symbols; Title Page; Copyright Page; Contents; Preface; 1 Sets and Logic; 1.1 Sets; 1.2 Propositions; 1.3 Conditional Propositions and Logical Equivalence; 1.4 Arguments and Rules of Inference; 1.5 Quantifiers; 1.6 Nested Quantifiers; Problem-Solving Corner: Quantifiers; Chapter 1 Notes; Chapter 1 Review; Chapter 1 Self-Test; Chapter 1 Computer Exercises; 2 Proofs; 2.1 Mathematical Systems, Direct Proofs, and Counterexamples; 2.2 More Methods of Proof; Problem-Solving Corner Proving Some Properties of Real Numbers; 2.3 Resolution Proofs; 2.4 Mathematical Induction.

Problem-Solving Corner Mathematical Induction2.5 Strong Form of Induction and the Well-Ordering Property; Chapter 2 Notes; Chapter 2 Review; Chapter 2 Self-Test; Chapter 2 Computer Exercises; 3 Functions, Sequences, and Relations; 3.1 Functions; Problem-Solving Corner: Functions; 3.2 Sequences and Strings; 3.3 Relations; 3.4 Equivalence Relations; Problem-Solving Corner: Equivalence Relations; 3.5 Matrices of Relations; 3.6 Relational Databases; Chapter 3 Notes; Chapter 3 Review; Chapter 3 Self-Test; Chapter 3 Computer Exercises; 4 Algorithms; 4.1 Introduction; 4.2 Examples of Algorithms.

5058 |a 4.3 Analysis of AlgorithmsProblem-Solving Corner Design and Analysis of an Algorithm; 4.4 Recursive Algorithms; Chapter 4 Notes; Chapter 4 Review; Chapter 4 Self-Test; Chapter 4 Computer Exercises; 5 Introduction to Number Theory; 5.1 Divisors; 5.2 Representations of Integers and Integer Algorithms; 5.3 The Euclidean Algorithm; Problem-Solving Corner Making Postage; 5.4 The RSA Public-Key Cryptosystem; Chapter 5 Notes; Chapter 5 Review; Chapter 5 Self-Test; Chapter 5 Computer Exercises; 6 Counting Methods and the PigeonholePrinciple; 6.1 Basic Principles; Problem-Solving Corner: Counting.

6.2 Permutations and CombinationsProblem-Solving Corner: Combinations; 6.3 Generalized Permutations and Combinations; 6.4 Algorithms for Generating Permutations and Combinations; 6.5 Introduction to Discrete Probability; 6.6 Discrete Probability Theory; 6.7 Binomial Coefficients and Combinatorial Identities; 6.8 The Pigeonhole Principle; Chapter 6 Notes; Chapter 6 Review; Chapter 6 Self-Test; Chapter 6 Computer Exercises; 7 Recurrence Relations; 7.1 Introduction; 7.2 Solving Recurrence Relations; Problem-Solving Corner Recurrence Relations; 7.3 Applications to the Analysis of Algorithms.

7.4 The Closest-Pair ProblemChapter 7 Notes; Chapter 7 Review; Chapter 7 Self-Test; Chapter 7 Computer Exercises; 8 Graph Theory; 8.1 Introduction; 8.2 Paths and Cycles; Problem-Solving Corner: Graphs; 8.3 Hamiltonian Cycles and the Traveling Salesperson Problem; 8.4 A Shortest-Path Algorithm; 8.5 Representations of Graphs; 8.6 Isomorphisms of Graphs; 8.7 Planar Graphs; 8.8 Instant Insanity; Chapter 8 Notes; Chapter 8 Review; Chapter 8 Self-Test; Chapter 8 Computer Exercises; 9 Trees; 9.1 Introduction; 9.2 Terminology and Characterizations of Trees; Problem-Solving Corner Trees.

Description based on online resource; title from digital title page (viewed on January 22, 2019).

There are no comments on this title.

to post a comment.
Share