Items related to Fundamentals of Discrete Math for Computer Science:...
Synopsis
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.
"synopsis" may belong to another edition of this title.
From the Back Cover
An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence.
Fundamentals of Discrete Math for Computer Science 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.
Topics and features:
- 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, with modular chapters following ACM curriculum recommendations
- Describes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expected
- 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 easy-to-understand and fun-to-read textbook is ideal for an introductory discrete mathematics course for computer science students at the beginning of their studies. The book assumes no prior mathematical knowledge, and discusses concepts in programming as needed, allowing it to be used in a mathematics course taken concurrently with a student’s first programming course.
About the Author
Dr. Tom Jenkyns is an Associate Professor in the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is an Instructor in the Department of Computer Science at the University of Calgary, Canada.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- ISBN 10 1447140702
- ISBN 13 9781447140702
- BindingPaperback
(No Available Copies)
Search Books: Create a WantIf you know the book but cannot find it on AbeBooks, we can automatically search for it on your behalf as new inventory is added. If it is added to AbeBooks by one of our member booksellers, we will notify you!
Create a Want
