Discrete Mathematics for Computer Science An Example-Based Introduction

Discrete Mathematics for Computer Science: An Example-Based Introduction, Second Edition, is intended for a first- or second-year discrete mathematics course for computer science and information systems majors. It covers many important mathematical topics essential for these students, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, trees, and relations with their applications to databases.

Features:

• Especially useful for community college courses; ideal as a first- or second-year textbook for computer science and information systems majors, or as a general introduction to discrete mathematics
• Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking
• Filled with over 200 worked examples, boxed for easy reference, and over 200 end-of-chapter problems, many with multiple parts
• Contains approximately 40 simple algorithms, highlighted for easy reference, to aid students in becoming proficient with algorithm control structures and pseudocode
• Includes an appendix on basic circuit design, which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers

New to the Second Edition:

• A new section at the end of each chapter that implements algorithms in Python and illustrates mathematical concepts with working code, introducing the essential Python skills needed by students who are new to the language
• Expanded computational content, including experimental time-complexity analysis; Python implementation of graph algorithms such as Dijkstra's, Hierholzer's, and Warshall's algorithms, with NetworkX visualization; and implementation of binary search trees, AVL trees, B-trees, and binary heaps
• A new chapter on relations and their applications in databases, linking set theory to entity-relationship models, normalization, and an introduction to SQL
• Many additional end-of-chapter problems, including Python programming exercises
• A downloadable PDF solution manual containing solutions to the end-of-chapter problems