| 000 -LEADER |
|---|
| fixed length control field |
a |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
220505b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780367549893 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.0151 |
| Item number |
FOR |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Fortney, Jon Pierre |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Discrete mathematics for computer science : an example-based introduction |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher, distributor, etc |
Chapman and Hall/CRC, |
| Date of publication, distribution, etc |
2022 |
| Place of publication, distribution, etc |
Boca Raton : |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xii,257 p. ; |
| Other physical details |
ill., |
| Dimensions |
25 cm |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
52.99 |
| Price type code |
GBP |
| Unit of pricing |
104.80 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and 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". |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science |
|
|---|
| Topical term or geographic name as entry element |
Discrete mathematics |
|
|---|
| Topical term or geographic name as entry element |
Mathematics |
|
|---|
| Topical term or geographic name as entry element |
Algorithm |
|
|---|
| Topical term or geographic name as entry element |
Codomain |
|
|---|
| Topical term or geographic name as entry element |
DeMorgan's laws |
|
|---|
| Topical term or geographic name as entry element |
Duality principle |
|
|---|
| Topical term or geographic name as entry element |
Euler path |
|
|---|
| Topical term or geographic name as entry element |
Hexadecimal numbers |
|
|---|
| Topical term or geographic name as entry element |
Loop controls |
|
|---|
| Topical term or geographic name as entry element |
Pseudocode |
|
|---|
| Topical term or geographic name as entry element |
Spanning tree |
|
|---|
| Topical term or geographic name as entry element |
Truth table |
|
|---|
| Topical term or geographic name as entry element |
Vertex |
|
|---|
| Topical term or geographic name as entry element |
Weighted graph |
|
|---|
| Topical term or geographic name as entry element |
Xnor gate |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |