Professional programmers and computer science students alike will appreciate this easy-to-use reference. It provides the vital foundation every computer scientist must have -- how to formulate an algorithm in some mathematical form.
To accomplish this, the author uses a layered approach with each successive chapter reinforcing the preceding chapters. Numerous exercises, graded by level of difficulty, are provided to fully convey the material.
A proven text for introductory computer science courses, the book includes sections on sets, functions, and relations; algebraic systems; and programming applications.