MARC details
| 000 -LEADER |
|---|
| fixed length control field |
04494nam a2200337 a 4500 |
| 001 - CONTROL NUMBER |
|---|
| EWU control number |
9427 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
BD-DhEWU |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20240815121429.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
240815s2021 flua g 001 0 eng d |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
|---|
| LC control number |
2020034984 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780367549886 |
|
|---|
| Cancelled/invalid ISBN |
9781003091479 |
|
|---|
| Cancelled/invalid ISBN |
9781000296808 |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| OCLC control number |
(OCLC)1227395034 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
DLC |
| Language of cataloging |
eng |
| Description conventions |
rda |
| Transcribing agency |
DLC |
| 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 |
004.0151 |
| Author mark and Year |
FOD 2021 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Fortney, Jon Pierre. |
| 9 (RLIN) |
25768 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Discrete mathematics for computer science : |
| Remainder of title |
an example-based introduction / |
| Statement of responsibility, etc |
Jon Pierre Fortney. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Boca Raton : |
| Name of publisher, distributor, etc |
CRC Press, |
| Date of publication, distribution, etc |
2021. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xii, 257 p. : |
| Other physical details |
ill. ; |
| Dimensions |
25 cm |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
Table of contents |
| Contents note |
CHAPTER 1: Introduction to Algorithms<br/>1.1. WHAT ARE ALGORITHMS?<br/>1.2. CONTROL STRUCTURES<br/>1.3. TRACING AN ALGORITHM<br/>1.4. ALGORITHM EXAMPLES<br/>1.5. PROBLEMS<br/>CHAPTER 2: Number Representations<br/>2.1. WHOLE NUMBERS<br/>2.2. FRACTIONAL NUMBERS<br/>2.3. THE RELATIONSHIP BETWEEN BINARY, OCTAL, AND HEXADECIMAL NUMBERS<br/>2.4. CONVERTING FROM DECIMAL NUMBERS<br/>2.5. PROBLEMS<br/>CHAPTER 3: Logic<br/>3.1. PROPOSITIONS AND CONNECTIVES<br/>3.2. CONNECTIVE TRUTH TABLES 3.3. TRUTH VALUE OF COMPOUND STATEMENTS<br/>3.4. TAUTOLOGIES AND CONTRADICTIONS<br/>3.5. LOGICAL EQUIVALENCE AND THE LAWS OF LOGIC<br/>3.6. PROBLEMS<br/>CHAPTER 4: Set Theory<br/>4.1. SET NOTATION<br/>4.2. SET OPERATIONS<br/>4.3. VENN DIAGRAMS<br/>4.4. THE LAWS OF SET THEORY<br/>4.5. BINARY RELATIONS ON SETS<br/>4.6. PROBLEMS<br/>CHAPTER 5: Boolean Algebra<br/>5.1. DEFINITION OF BOOLEAN ALGEBRA<br/>5.2. LOGIC AND SET THEORY AS BOOLEAN ALGEBRAS<br/>5.3. DIGITAL CIRCUITS<br/>5.4. SUMS-OF-PRODUCTS AND PRODUCTS-OF-SUMS<br/>5.5. PROBLEMS<br/>CHAPTER 6: Functions<br/>6.1. INTRODUCTION TO FUNCTIONS 6.2. REAL-VALUED FUNCTIONS<br/>6.3. FUNCTION COMPOSITION AND INVERSES<br/>6.4. PROBLEMS<br/>CHAPTER 7: Counting and Combinatorics<br/>7.1. ADDITION AND MULTIPLICATION PRINCIPLES<br/>7.2. COUNTING ALGORITHM LOOPS<br/>7.3. PERMUTATIONS AND ARRANGEMENTS<br/>7.4. COMBINATIONS AND SUBSETS<br/>7.5. PERMUTATION AND COMBINATION EXAMPLES<br/>7.6. PROBLEMS<br/>CHAPTER 8: Algorithmic Complexity<br/>8.1. OVERVIEW OF ALGORITHMIC COMPLEXITY<br/>8.2. TIME-COMPLEXITY FUNCTIONS<br/>8.3. FINDING TIME-COMPLEXITY FUNCTIONS<br/>8.4. BIG-O NOTATION<br/>8.5. RANKING ALGORITHMS<br/>8.6. PROBLEMS<br/>CHAPTER 9: Graph Theory 9.1. BASIC DEFINITIONS<br/>9.2. EULERIAN AND SEMI-EULERIAN GRAPHS<br/>9.3. MATRIX REPRESENTATIONS OF GRAPHS<br/>9.4. REACHABILITY FOR DIRECTED GRAPHS<br/>9.5. PROBLEMS<br/>CHAPTER 10: Trees<br/>10.1. BASIC DEFINITIONS<br/>10.2. MINIMAL SPANNING TREES OF WEIGHTED GRAPHS<br/>10.3. MINIMAL DISTANCE PATHS<br/>10.4. PROBLEMS<br/>APPENDIX A: Basic Circuit Design<br/>A.1. BINARY ADDITION<br/>A.2. THE HALF-ADDER<br/>A.3. THE FULL-ADDER<br/>A.4. ADDING TWO EIGHT-DIGIT BINARY NUMBERS<br/>APPENDIX B: Answers to Problems<br/>B.1. CHAPTER ONE ANSWERS<br/>B.2. CHAPTER TWO ANSWERS<br/>B.3. CHAPTER THREE ANSWERS B.4. CHAPTER FOUR ANSWERS<br/>B.5. CHAPTER FIVE ANSWERS<br/>B.6. CHAPTER SIX ANSWERS<br/>B.7. CHAPTER SEVEN ANSWERS<br/>B.8. CHAPTER EIGHT ANSWERS<br/>B.9. CHAPTER NINE ANSWERS<br/>B.10. CHAPTER TEN ANSWERS<br/>Index |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
"Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features designed to be especially useful for courses at the community college level Ideal as a first or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers. Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode. An appendix on basic circuit design provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers"-- |
| 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 |
Computer science |
| General subdivision |
Mathematics. |
| 856 42 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Materials Specified |
WorldCat Details |
| Uniform Resource Identifier |
https://search.worldcat.org/title/1227395034?oclcNum=1227395034 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Text |