| 書目名稱 | Discrete Mathematics for Computing | | 編輯 | Peter Grossman | | 視頻video | http://file.papertrans.cn/282/281148/281148.mp4 | | 圖書封面 |  | | 描述 | Written in a clear and informal style aimed especially at students with a limited background in mathematics, this introduction to discrete mathematics presents the material that forms the essential mathematical background for studies in computing and information systems. The topics covered include number systems, logic, relations, functions, induction, recursion, Boolean algebra, combinatorics, graph theory and number theory. The text contains many examples of applications of the theory to problems in computing, including a chapter on the representation and manipulation of numbers in a computer, examples of the use of propositional logic in program design, a section discussing the relationship between the mathematical and programming concepts of a function, and a chapter on the estimation of the time complexity of algorithms. A feature of the book is the use of algorithms written in pseudo code in many examples throughout the text. The exercises at the end of each chapter provide both routine drill of basic techniques and more challenging problems designed to enhance and extend the students‘ understanding. Answers to most of the exercises are provided at the back of the book.With i | | 出版日期 | Textbook 1995Latest edition | | 關(guān)鍵詞 | algebra; algorithms; Boolean algebra; code; combinatorics; complexity; computational complexity; discrete m | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-349-13908-8 | | copyright | Peter Grossman 1995 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 06:41
發(fā)表于 2025-3-21 18:26:34
