| 书目名称 | Fundamentals of Discrete Math for Computer Science | | 副标题 | A Problem-Solving Pr | | 编辑 | Tom Jenkyns,Ben Stephenson | | 视频video | | | 概述 | Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics.Ideally structured for classroom-use and self-study, wit | | 丛书名称 | Undergraduate Topics in Computer Science | | 图书封面 |  | | 描述 | This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. .Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; contains examples and exercises throughout the text, and highlights the most important concepts in each section; selects examples that demonstrate a practical use for the concept in question.. | | 出版日期 | Textbook 20131st edition | | 关键词 | Analysis of Algorithms; Complexity Analysis; Discrete Mathematics; Proof of Correctness; algorithm analy | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4471-4069-6 | | isbn_ebook | 978-1-4471-4069-6Series ISSN 1863-7310 Series E-ISSN 2197-1781 | | issn_series | 1863-7310 | | copyright | Springer-Verlag London Ltd., part of Springer Nature 2013 |
The information of publication is updating
|
|
发表于 2025-3-21 17:46:16
