MARC details
| 000 -LEADER |
| fixed length control field |
04319nam a2200337 a 4500 |
| 001 - CONTROL NUMBER |
| EWU control number |
9407 |
| 003 - CONTROL NUMBER IDENTIFIER |
| control field |
BD-DhEWU |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
| control field |
20240801120228.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
| fixed length control field |
240801s2022 -cna g b 001 0 eng d |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
| LC control number |
2020044756 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
| International Standard Book Number |
9781284184761 |
| 035 ## - SYSTEM CONTROL NUMBER |
| OCLC control number |
(OCLC)1235592798 |
| 040 ## - CATALOGING SOURCE |
| Original cataloging agency |
DLC |
| Language of cataloging |
eng |
| Transcribing agency |
DLC |
| Description conventions |
rda |
| Modifying agency |
BD-DhEWU |
| 041 ## - LANGUAGE CODE |
| Language code of text/sound track or separate title |
eng |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
| Classification number |
510 |
| Author mark and Year |
HUE 2022 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
| Personal name |
Hunter, David James. |
| Dates associated with a name |
1968- |
| 245 10 - TITLE STATEMENT |
| Title |
Essentials of discrete mathematics / |
| Statement of responsibility, etc |
by David J. Hunter. |
| 250 ## - EDITION STATEMENT |
| Edition statement |
4th ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
| Place of publication, distribution, etc |
Burlington : |
| Name of publisher, distributor, etc |
Jones & Bartlett Learning, |
| Date of publication, distribution, etc |
2022. |
| 300 ## - PHYSICAL DESCRIPTION |
| Extent |
xii, 354 p. : |
| Other physical details |
ill. ; |
| Dimensions |
28 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
| Bibliography, etc |
Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
| Title |
Table of contents |
| Contents note |
Cover<br/>Title Page<br/>Copyright Page<br/>Contents<br/>Preface<br/>Introduction<br/>What's New in the Fourth Edition<br/>How to Use this Book<br/>About the Cover<br/>Supplements<br/>Acknowledgments<br/>Chapter 1 Logical Thinking<br/>1.1 Formal Logic<br/>1.1.1 Preview Questions<br/>1.1.2 Connectives and Propositions<br/>1.1.3 Truth Tables<br/>1.1.4 Activities<br/>1.1.5 Logical Equivalences<br/>Exercises 1.1<br/>1.2 Propositional Logic<br/>1.2.1 Tautologies and Contradictions<br/>1.2.2 Derivation Rules<br/>1.2.3 Proof Sequences<br/>1.2.4 Forward-Backward<br/>Exercises 1.2<br/>1.3 Predicate Logic<br/>1.3.1 Predicates 1.3.2 Quantifiers<br/>1.3.3 Translation<br/>1.3.4 Negation<br/>1.3.5 Two Common Constructions<br/>Exercises 1.3<br/>1.4 Logic in Mathematics<br/>1.4.1 The Role of Definitions in Mathematics<br/>1.4.2 Other Types of Mathematical Statements<br/>1.4.3 Counterexamples<br/>1.4.4 Axiomatic Systems<br/>Exercises 1.4<br/>1.5 Methods of Proof<br/>1.5.1 Direct Proofs<br/>1.5.2 Proof by Contraposition<br/>1.5.3 Proof by Contradiction<br/>Exercises 1.5<br/>Chapter 2 Relational Thinking<br/>2.1 Graphs<br/>2.1.1 Edges and Vertices<br/>2.1.2 Terminology<br/>2.1.3 Modeling Relationships with Graphs<br/>Exercises 2.1<br/>2.2 Sets 2.2.1 Membership and Containment<br/>2.2.2 New Sets from Old<br/>2.2.3 Identities<br/>Exercises 2.2<br/>2.3 Functions<br/>2.3.1 Definition and Examples<br/>2.3.2 One-to-One and Onto Functions<br/>2.3.3 New Functions from Old<br/>Exercises 2.3<br/>2.4 Relations and Equivalences<br/>2.4.1 Definition and Examples<br/>2.4.2 Graphs of Relations<br/>2.4.3 Relations vs. Functions<br/>2.4.4 Equivalence Relations<br/>2.4.5 Modular Arithmetic<br/>Exercises 2.4<br/>2.5 Partial Orderings<br/>2.5.1 Definition and Examples<br/>2.5.2 Hasse Diagrams<br/>2.5.3 Topological Sorting<br/>2.5.4 Isomorphisms<br/>2.5.5 Boolean Algebras Exercises 2.5<br/>2.6 Graph Theory<br/>2.6.1 Graphs: Formal Definitions<br/>2.6.2 Isomorphisms of Graphs<br/>2.6.3 Degree Counting<br/>2.6.4 Euler Paths and Circuits<br/>2.6.5 Hamilton Paths and Circuits<br/>2.6.6 Trees<br/>Exercises 2.6<br/>Chapter 3 Recursive Thinking<br/>3.1 Recurrence Relations<br/>3.1.1 Definition and Examples<br/>3.1.2 The Fibonacci Sequence<br/>3.1.3 Modeling with Recurrence Relations<br/>Exercises 3.1<br/>3.2 Closed-Form Solutions and Induction<br/>3.2.1 Guessing a Closed-Form Solution<br/>3.2.2 Polynomial Sequences: Using Differences<br/>3.2.3 Inductively Verifying a Solution Exercises 3.2<br/>3.3 Recursive Definitions<br/>3.3.1 Definition and Examples<br/>3.3.2 Writing Recursive Definitions<br/>3.3.3 Recursive Geometry<br/>3.3.4 Recursive Jokes<br/>Exercises 3.3<br/>3.4 Proof by Induction<br/>3.4.1 The Principle of Induction<br/>3.4.2 Examples<br/>3.4.3 Strong Induction<br/>3.4.4 Structural Induction<br/>Exercises 3.4<br/>3.5 Recursive Data Structures<br/>3.5.1 Lists<br/>3.5.2 Efficiency<br/>3.5.3 Binary Search Trees Revisited<br/>Exercises 3.5<br/>Chapter 4 Quantitative Thinking<br/>4.1 Basic Counting Techniques<br/>4.1.1 Addition<br/>4.1.2 Multiplication |
| 520 ## - SUMMARY, ETC. |
| Summary, etc |
"Essentials of Discrete Mathematics is designed for the one-semester undergraduat,e discrete math course. This course geared towards math and computer science majors. The textbook is organized around five types of mathematical thinking, with each chapter addressing a different type of thinking: logical, relational, recursive, quantitative, and analytical. The final chapter, "Thinking Through Applications" looks at different ways that discrete math thinking can be applied. Applications are included throughout the textbook and are sourced from a variety of disciplines, including biology, economics, music, and more"-- |
| 526 ## - STUDY PROGRAM INFORMATION NOTE |
| Program name |
Computer Science & Engineering |
| Requested Dept. (EWU) |
Computer Science & Engineering |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
| Topical term or geographic name |
Discrete Mathematics. |
| 9 (RLIN) |
9839 |
| 856 42 - ELECTRONIC LOCATION AND ACCESS |
| Materials Specified |
WorldCat |
| Uniform Resource Identifier |
https://search.worldcat.org/title/1235592798 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Text |