Connecting discrete mathematics and computer science / David Liben-Nowell

By:

Liben-Nowell, David

Material type: Text

TextPublication details: USA : John Wiley and Sons, c2022Edition: Second editionDescription: 647 pages : illustration ; 26cmISBN:

978-1-00-915049-1

Subject(s):

MATHEMATICS

LOC classification:

GC QA 39 .L48 2022 c.1

Contents:

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.

Summary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Collection	Shelving location	Call number	Status	Date due	Barcode
Books	NU BALIWAG	NU BALIWAG	Computer Engineering	General Circulation	GC QA 39 .L48 2022 c.1 (Browse shelf(Opens below))	Available		NUBUL000005079

Includes References and Index.

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.

to post a comment.