| 書目名稱 | Fundamentals of Discrete Math for Computer Science |
| 副標(biāo)題 | A Problem-Solving Pr |
| 編輯 | Tom Jenkyns,Ben Stephenson |
| 視頻video | http://file.papertrans.cn/351/350261/350261.mp4 |
| 概述 | 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 |
| 關(guān)鍵詞 | 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 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 15:22
發(fā)表于 2025-3-21 17:46:16
