Beginner's Guide to Discrete Mathematics
Graph study is discussed, including Euler and Hamilton cycles and trees. This is a vehicle for some easy proofs, as well as serving as another example of a data structure. Matrices and vectors are then defined. The book concludes with an introduction to cryptography, including the RSA cryptosystem, together with the necessary elementary number theory, e.g., Euclidean algorithm, Fermat's Little Theorem.
Good examples occur throughout. At the end of every section there are two problem sets of equal difficulty. However, solutions are only given to the first set. References and index conclude the work.
A math course at the college level is required to handle this text. College algebra would be the most helpful.