Discrete mathematics / (Record no. 56818)

MARC details
000 -LEADER
fixed length control field 03985 a2200325 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20210817112333.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 210817b ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1292233702
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781292233703
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781292233727 electronic book
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1292233729 electronic book
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA39.2
Item number .J65 2019
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Johnsonbaugh, Richard, 1941-
245 ## - TITLE STATEMENT
Title Discrete mathematics /
Statement of responsibility, etc Richard Johnsonbaugh.
250 ## - EDITION STATEMENT
Edition statement Eighth edition, global edition.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Pearson Education Limited,
Date of publication, distribution, etc 2019
Place of publication, distribution, etc Harlow, United Kingdom :
300 ## - PHYSICAL DESCRIPTION
Extent 767p. :
Dimensions 27cm.
500 ## - GENERAL NOTE
General note Includes bibliographical references and index.
500 ## - GENERAL NOTE
General note 9.3 Spanning Trees.<br/>
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 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.<br/>
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 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.<br/>
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 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.<br/>
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 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.<br/><br/>
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 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.
586 ## - AWARDS NOTE
Awards note Description based on online resource; title from digital title page (viewed on January 22, 2019).<br/>
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Item type Book
Source of classification or shelving scheme Library of Congress Classification
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Total Renewals Full call number Barcode Date last seen Date last borrowed Copy number Price effective from Koha item type
    Library of Congress Classification     Non-fiction Bishop Okullu Memorial Library (Limuru Campus) Bishop Okullu Memorial Library (Limuru Campus) General Circulation 17/08/2021 PURCHASE 4529.00 14 1 QA39.2 .J65 2019 066499 13/04/2026 10/04/2026 1 17/08/2021 Book
    Library of Congress Classification     Non-fiction Nairobi Campus Nairobi Campus General Circulation 17/08/2021 PURCHASE 4529.00 8 1 QA39.2 .J65 2019 066500 05/11/2025 21/10/2025 2 17/08/2021 Book