Discrete Mathematics By Olympia Nicodemi __link__ -

For those heading into computer science, the chapters on counting (combinatorics) are invaluable. Nicodemi covers permutations, combinations, and the Pigeonhole Principle with a focus on problem-solving strategies that apply to algorithm analysis and complexity. 4. Graph Theory and Relations

: Mastery of non-continuous mathematical structures like boolean arithmetic , combinatorics , and graph theory . Discrete Mathematics by Olympia Nicodemi

Nicodemi’s book is specifically designed to be . It is often used in introductory courses for students who may not yet be math majors but need a solid grounding in the concepts. If you have ever felt overwhelmed by the dense, encyclopedic tomes usually assigned in CS programs, this book comes as a breath of fresh air. For those heading into computer science, the chapters