離散数学とコンピュータ科学を結ぶ(第2版)<br>Connecting Discrete Mathematics and Computer Science (2ND)

個数:

離散数学とコンピュータ科学を結ぶ(第2版)
Connecting Discrete Mathematics and Computer Science (2ND)

  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版/ページ数 690 p.
  • 言語 ENG
  • 商品コード 9781009150491
  • DDC分類 004.0151

Full Description

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.

Contents

1. On the point of this book; 2. 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.

最近チェックした商品