This book is designed to form the basis of a one-year course in discrete mathematics for first-year computer scientists or software engineers. The materials presented cover much of undergraduate algebra with a particular bias toward the computing applications. Topics covered include mathematical logic, set theory, finite and infinite relations and mapping, graphs, graphical algorithms and axiom systems. It concludes with implementations of many of the algorithms in Modula-2 to illustrate how the mathematics may be turned into concrete calculations. Numerous examples and exercises are included...