Discrete Algorithmic Mathematics

by Stephen B. Maurer, Anthony Ralston

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well. A manual of selected solutions is available for sale to students; see sidebar. A complete solution manual is available free to instructors who have adopted the book as a required text.

804 pages, Hardcover

First published January 1, 1990

Reviews

[Investiie]

another thick and *heavy* book i bought.. (and almost never read!!) rugi banget gak seeeh... :P