| Edition | Publisher | Year | Pages | ISBN | Availability | | :--- | :--- | :--- | :--- | :--- | :--- | | US Hardcover | West Publishing | 1987 | 491 | 9780314285034 | Used copies via AbeBooks, WorldCat | | India Paperback | CBS Publishers | 1987/1989 | 491 | Not listed | Used copies via library catalogs |
The logical progression of topics offers an excellent framework for building a semester-long syllabus. Conclusion
Applying this simple yet powerful concept to non-trivial problems.
Counting arrangements with and without repetition.
Discrete Mathematics by Olympia Nicodemi (co-authored with Melissa A. Sutherland and Deborah A. Towsley) is a widely respected undergraduate textbook designed to introduce students to the essential structures and reasoning methods that define modern computer science and mathematics. While calculus focuses on continuous change, discrete mathematics deals with distinct, separated values—the foundation of computing. Discrete Mathematics by Olympia Nicodemi
Problems range from basic computation to challenging theoretical proofs.
Discrete Mathematics by Olympia Nicodemi provides a strong, rigorous, and accessible pathway into the essential math of the modern digital age. By focusing on the fundamentals of mathematical reasoning and connecting them to computer science applications, it helps students transition from basic computation to abstract, critical thinking.
RSA encryption relies heavily on the number theory and modular arithmetic covered in the book.
The text explicitly links mathematical structures to computer science equivalents, such as mapping relations to databases and trees to data sorting. Lasting Impact and Target Audience | Edition | Publisher | Year | Pages
Discrete Mathematics is a fundamental text written by Olympia Nicodemi, designed to provide students with a comprehensive introduction to the essential concepts and principles of discrete mathematics. This branch of mathematics deals with mathematical structures that are fundamentally discrete, rather than continuous, and is a crucial foundation for computer science, information technology, and related fields.
As computer science programs increasingly rely on discrete math, students need to see why these theories matter. Nicodemi’s book consistently anchors abstract mathematical concepts to real-world computer science applications. This makes the material feel relevant and highly practical, helping students understand the "why" behind the mathematical "what." 3. Clear, Intuitive Explanations
[Mathematical Logic & Proofs] ➔ [Sets, Relations & Functions] ➔ [Combinatorics & Probability] │ [Algebraic Structures & FSMs] 💡 🧠 [Graph Theory & Trees] 💻 🎛️ ◄──────┘ Key Curricular Topics and Concepts 1. Formal Logic and Propositional Forms
Each section includes a graduated set of exercises, ranging from routine computation to challenging, proof-oriented problems. their policies apply.
Finding paths (like Euler and Hamilton paths) to solve logistics problems.
Where other books might present the Pigeonhole Principle as a simple formula followed by ten computational exercises, Nicodemi pauses. She asks: Why does this work? Can you construct a counterexample? The book is notoriously light on "plug-and-chug" exercises and heavy on proofs, generalizations, and open-ended problems.
Modeling networks, data structures, and trees. Why Choose Nicodemi’s Approach?
While it is a math book at its heart, the applications to computer science—such as algorithm analysis and logic gates—make it an invaluable resource for CS students who need to understand the "why" behind the code. Final Thoughts
This public link is valid for 7 days and shares a thread, including any personal information you added. This link or copies made by others cannot be deleted. If you share with third parties, their policies apply. Can’t copy the link right now. Try again later. Department of Computer Science