Fundamentals of Discrete Math for Computer Science
A Problem-Solving Primer
Nonfiction, Computers, Database Management, Data Processing, Science & Nature, Mathematics, Programming
| Author: | Ben Stephenson, Tom Jenkyns | ISBN: | 9781447140696 |
| Publisher: | Springer London | Publication: | October 16, 2012 |
| Imprint: | Springer | Language: | English |
| Author: | Ben Stephenson, Tom Jenkyns |
| ISBN: | 9781447140696 |
| Publisher: | Springer London |
| Publication: | October 16, 2012 |
| Imprint: | Springer |
| Language: | English |
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.
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.
