MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02035nam a2200229Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NUBLRC |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
241210s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
978-1-00-915049-1 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NUBLRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
GC QA 39 .L48 2022 c.1 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Liben-Nowell, David |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Connecting discrete mathematics and computer science / |
| Statement of responsibility, etc. |
David Liben-Nowell |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Second edition |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
USA : |
| Name of publisher, distributor, etc. |
John Wiley and Sons, |
| Date of publication, distribution, etc. |
c2022 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
647 pages : |
| Other physical details |
illustration ; |
| Dimensions |
26cm. |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD 70.00 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes References and Index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
1. On the Point of this Book -- Basic Data Types -- 3. Logic -- 4. Proofs -- 5. Mathematical Induction -- 6. Analysis of Algorithms -- 7. Number Theory -- 8. Relations -- 9. Counting -- 10. Probability -- 11. Graphs and Trees -- 12. Looking Forward. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Computer science majors taking a non-programming-based course like discrete mathematics might ask 'Why do I need to learn this?' Written with these students in mind, this text introduces the mathematical foundations of computer science by providing a comprehensive treatment of standard technical topics while simultaneously illustrating some of the broad-ranging applications of that material throughout the field. Chapters on core topics from discrete structures – like logic, proofs, number theory, counting, probability, graphs – are augmented with around 60 'computer science connections' pages introducing their applications: for example, game trees (logic), triangulation of scenes in computer graphics (induction), the Enigma machine (counting), algorithmic bias (relations), differential privacy (probability), and paired kidney transplants (graphs). Pedagogical features include 'Why You Might Care' sections, quick-reference chapter guides and key terms and results summaries, problem-solving and writing tips, 'Taking it Further' asides with more technical details, and around 1700 exercises, 435 worked examples, and 480 figures. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
MATHEMATICS |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
