Discrete Algorithmic Mathematics Third Edition Stephen B Maurer

0 views

Skip to first unread message

Marry Kirklin

unread,

Jan 24, 2024, 7:42:24 PM1/24/24

to tisconthansbe

Amazon.co.uk
BookDepository
Waterstones
WHSmith
Blackwell
Google Product Search
Find in a library
All sellers

_OC_InitNavbar("child_node":["title":"My library","url":" =114584440181414684107\u0026source=gbs_lp_bookshelf_list","id":"my_library","collapsed":true,"title":"My History","url":"","id":"my_history","collapsed":true],"highlighted_node_id":"");Discrete Algorithmic Mathematics, Third EditionStephen B. Maurer, Anthony RalstonTaylor & Francis, 21 Jan 2005 - Mathematics - 803 pagesThoroughly 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.

Discrete Algorithmic Mathematics Third Edition Stephen B Maurer

DOWNLOAD · https://t.co/tcFdDMm290

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.

Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh's algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization.

Starting in the late 1970s and continuing until the present, his interests turned to education, first the mathematical aspects of computer science education, then college and university mathematics education generally and, for the past few years, elementary and secondary mathematics education. He has been at the forefront of those calling for more emphasis on discrete mathematics in undergraduate mathematics and computer science education, beginning with a paper "Computer Science, Mathematics and the Undergraduate Curricula in Both" and culminating in 1991 with a book, Discrete Algorithmic Mathematics (coauthored with Stephen B. Maurer).

"Questions about education arouse strong feelings. For this reason and because seldom, if ever, can propositions about education be proved or even strongly supported with evidence, they provoke strong statements.... Our essential proposition is simple and not immodest. It is time to consider (i.e., try) an alternative to the standard undergraduate mathematics curriculum, which would give discrete analysis an equivalent role to that now played by calculus in the first two years of the undergraduate curriculum."