Cartesian products, domain/range, and types of functions (one-to-one, onto). Graph Theory: Definitions of graphs, isomorphism, and connectivity. Binary trees, spanning trees, and fundamental circuits. Combinatorics: Counting principles and elementary algebra. Applications and Practicality
Understanding structures requires a firm grasp of how elements interact. Discrete Mathematics by Olympia Nicodemi
Mastering the Foundations: A Deep Dive into "Discrete Mathematics" by Olympia Nicodemi Combinatorics: Counting principles and elementary algebra
Often described as the "math of computing," it is the foundation upon which algorithms, cryptography, and data structures are built. But finding the right resource to learn it can be tricky. Some textbooks are dry and impenetrable; others are so superficial they leave you with more questions than answers. But finding the right resource to learn it can be tricky
Olympia Nicodemi is a Professor Emerita of Mathematics at the State University of New York (SUNY) College at Geneseo. Unlike modern textbook authors who are often hired by publishing houses to compile existing curricula, Nicodemi is a working mathematician and educator who wrote her book based on how she actually taught the course.
Nicodemi’s text serves as a direct prerequisite for several critical advanced fields:
Problems range from basic computation to challenging theoretical proofs.
You must be logged in to post a comment.