Liben nowell david (29 résultats)

Etat : Acceptable. Readable, but has significant damage / tears. Has a remainder mark. hardcover Used - Acceptable 2022.

hardcover. Etat : Acceptable. A readable copy. All pages are intact, and the cover is intact (the dust cover may be missing). Pages can include notes--in pen or highlighter.

hardcover. Etat : New. 2nd Edition. Ships in a BOX from Central Missouri! UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Hardcover. Etat : Used Good. No Jacket.

Etat : New.

Hardcover. Etat : new. New Copy. Customer Service Guaranteed.

Etat : As New. Unread book in perfect condition.

Etat : Very Good. Ships same or next business day with delivery confirmation. Used - Very Good Expedited shipping available.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : New.

Buch. Etat : Neu. Neuware -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. Englisch.…

Buch. Etat : Neu. Neuware -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. Englisch.…

Etat : As New. Unread book in perfect condition.

Buch. Etat : Neu. Neuware -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.…

Etat : New. 2022. 2nd Edition. hardcover. . . . . .

Etat : New. This textbook is designed for undergraduate students taking a course on the mathematical foundations of computer science. It is written from an exclusively CS perspective rather than for a mixed-discipline audience, helping CS students see the ways that fou.

Etat : New. pp. 690.

Etat : New. pp. 690.

Buch. Etat : Neu. Neuware - 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.…

Buch. Etat : Neu. Neuware -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.Libri GmbH, Europaallee 1, 36244 Bad Hersfeld Englisch.…

Etat : New. 2022. 2nd Edition. hardcover. . . . . . Books ship from the US and Ireland.

Buch. Etat : Neu. Connecting Discrete Mathematics and Computer Science | David Liben-Nowell | Buch | Gebunden | Englisch | 2022 | Cambridge University Pr. | EAN 9781009150491 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.

Hardcover. Etat : Brand New. 2nd edition. 700 pages. 10.00x8.00x1.50 inches. In Stock.

Buch. Etat : Neu. Neuware -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. Englisch.…

Paperback. Etat : Acceptable. Acceptable. Dust Jacket NOT present. CD WILL BE MISSING. SHIPS FROM MULTIPLE LOCATIONS. book.

Hardcover. Etat : Brand New. 2nd edition. 700 pages. 10.00x8.00x1.50 inches. In Stock. This item is printed on demand.

Etat : New. PRINT ON DEMAND pp. 690.

Hardcover. Etat : new. Hardcover. 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. This textbook is designed for undergraduate students taking a course on the mathematical foundations of computer science. It is written from an exclusively CS perspective rather than for a mixed-discipline audience, helping CS students see the ways that foundational mathematical material is central to the discipline of computer science. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…