Fundamentals of Discrete Math for Computer Science

This book offers an engaging introduction to traditional topics in discrete mathematics, in a manner designed to appeal to computer science students. Presents detailed walkthroughs of several algorithms, along with exercises and practical examples throughout.

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

Contains examples and exercises throughout the text, and highlights the most important concepts in each section

Updated and enhanced new edition with additional material on directed graphs, and on drawing and coloring graphs, as well as more than 100 new exercises (with solutions) 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 Contains examples and exercises throughout the text, and highlights the most important concepts in each section

Autorentext

Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.

Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.

Inhalt

Algorithms, Numbers and Machines.- Sets, Sequences and Counting.- Boolean Expressions, Logic and Proof.- Searching and Sorting.- Graphs and Trees.- Relations: Especially on (Integer) Sequences.- Sequences and Series.- Generating Sequences and Subsets.- Discrete Probability and Average Case Complexity.- Turing Machines.