Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science) - Softcover

Jenkyns, Tom; Stephenson, Ben

Softcover

ISBN 10: 1447140680 ISBN 13: 9781447140689

Publisher: Springer, 2012

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.

About this title

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.

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.

Edition details

• Publisher: Springer
• Publication date: 2012
• Language: English
• ISBN 10: 1447140680
• ISBN 13: 9781447140689
• Binding: Paperback
• Number of pages: 416