Discrete Mathematics by Olympia Nicodemi is not for the faint of heart, nor is it for the student looking for a quick reference for computer science algorithms.
It forms the mathematical backbone of computer science. Everything from database structures and cryptography to network routing and algorithm analysis relies heavily on discrete concepts. Key topics include: Discrete Mathematics by Olympia Nicodemi
Understanding how objects group together and interact is fundamental to computer science. The text explores sets, functions, and relations (including equivalence relations and partial orderings), which are the building blocks for database theory and algorithm design. 3. Combinatorics (The Art of Counting) Discrete Mathematics by Olympia Nicodemi is not for