This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. Features: teaches finite math as a language for thinking, as much as knowledge and skills to be acquired; uses an intuitive approach with a focus on examples for all general concepts; brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction; balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives; includes highlight boxes that raise common queries and clear confusions; provides numerous exercises, with selected solutions.For example, your operation may be obtained by using the first two as follows: from (a, b, c) to (b, a, c) to (b, c, a) to (c, b, a), using the first, second and first operations. ... Your colleague across the corridor is in charge of another database recording their names and telephone extensions. ... following another one), and a set C of allowable telephone extension numbers (e.g. any figure of exactly four digits).

Title | : | Sets, Logic and Maths for Computing |

Author | : | David Makinson |

Publisher | : | Springer Science & Business Media - 2012-02-27 |

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

`1.`Register a free 1 month Trial Account.`2.`Download as many books as you like (Personal use)`3.`Cancel the membership at any time if not satisfied.