Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer

✍ Scribed by Tom Jenkyns, Ben Stephenson (auth.)

• Publisher: Springer-Verlag London
• Year: 2013
• Tongue: English
• Leaves: 424
• Series: Undergraduate Topics in Computer Science
• Edition: 1
• Category: Library

✦ 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.

✦ Table of Contents

Front Matter....Pages i-xii
Algorithms, Numbers, and Machines....Pages 1-42
Sets, Sequences, and Counting....Pages 43-75
Boolean Expressions, Logic, and Proof....Pages 77-130
Searching and Sorting....Pages 131-182
Graphs and Trees....Pages 183-231
Relations: Especially on (Integer) Sequences....Pages 233-264
Sequences and Series....Pages 265-309
Generating Sequences and Subsets....Pages 311-350
Discrete Probability and Average-Case Complexity....Pages 351-395
Turing Machines....Pages 397-411
Back Matter....Pages 413-416

✦ Subjects

Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity