Fundamentals of Discrete Math for Computer Science

Rezensionen / Stimmen

From the reviews:

"This book is dedicated to presenting the basic notions of discrete mathematics for undergraduate students in computer science. With a good balance between theory and practice - including the algorithmic point of view - this book will prove very helpful. . Many examples and exercises make the book both enjoyable and useful." (Jean-Paul Allouche, zbMATH, Vol. 1278, 2014)

"Jenkyns (Brock Univ., Canada) and Stephenson (Univ. of Calgary, Canada) have written an introductory textbook on discrete mathematics for computer science majors. The volume's ten chapters cover the standard topics taught in such courses at the freshman or sophomore level . . In comparison with other introductory discrete mathematics textbooks, this work has a very strong emphasis on algorithms, proofs of algorithmic correctness, and the analysis of worst-case and average-case complexity. . Summing Up: Recommended. Lower-division undergraduates." (B. Borchers, Choice, Vol. 50 (9), May, 2013)

"This book is specifically aimed at CS students. The authors include the same discrete math topics that other books have, but, in contrast to most existing books, they introduce each topic with a clear (and entertaining) CS motivation. . Each section is well written, with a highlighted subsection on the most important ideas and plenty of exercises. I highly recommend this book to everyone." (V. Kreinovich, Computing Reviews, December, 2012)