Connecting discrete mathematics and computer science / David Liben-Nowell
Material type:
TextPublication details: USA : John Wiley and Sons, c2022Edition: Second editionDescription: 647 pages : illustration ; 26cmISBN: - 978-1-00-915049-1
- GC QA 39 .L48 2022 c.1
| Item type | Home library | Collection | Shelving location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Books
|
NU BALIWAG | Computer Engineering | General Circulation | GC QA 39 .L48 2022 c.1 (Browse shelf(Opens below)) | Available | NUBUL000005079 |
Browsing NU BALIWAG shelves, Shelving location: General Circulation, Collection: Computer Engineering Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available |
|
|
|
|
|
||
| GC QA 371 .M36 2022 c.1 Differential equations : essential kills practice workbook with answers / | GC QA 371 .Z55 2019 Differential equations with boundary- value problems / | GC QA 39 .E67 2020 c.1 Discrete mathematics with application 5e : metric version / | GC QA 39 .L48 2022 c.1 Connecting discrete mathematics and computer science / | GC QA 402 .G86 2018 c.1 Signal and systems / | GC QA 404 .R53 2020 c.1 Integral workbook / | GC QA 76 .E27 2019 c.1 Easy learning data sturctures & algorithms : ES6 + JavaScript / |
Includes References and Index.
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.
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.
There are no comments on this title.
