𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

A Short Course In Discrete Mathematics

✍ Scribed by Edward A. Bender, S. Gill Williamson

Publisher
Dover Publications
Year
2004
Tongue
English
Leaves
256
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

This undergraduate-level describes the mathematics most needed in computer science. Bender and Williamson (both mathematics, U. of California, San Diego) cover Boolean functions and computer arithmetic, logic, number theory and cryptography, sets and functions, equivalence and order, and induction, sequences and series, all in discrete units with multiple choice questions for review. They include solutions to exercises and notational and subject indices. Readers should have some familiarity with calculus.

πŸ“œ SIMILAR VOLUMES

A Short Course in Discrete Mathematics
πŸ“ A Short Course in Discrete Mathematics
✍ Edward A. Bender, S. Gill Williamson πŸ“‚ Library πŸ“… 2005 πŸ› Dover Publications 🌐 English

<DIV>What sort of mathematics do I need for computer science? In response, a pair of professors at the University of California at San Diego created this text.Π’Β Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and i

A First Course in Discrete Mathematics
πŸ“ A First Course in Discrete Mathematics
✍ Ian Anderson πŸ“‚ Library πŸ“… 2002 πŸ› Springer 🌐 English

<p>Discrete mathematics has now established its place in most undergraduate mathematics courses. This textbook provides a concise, readable and accessible introduction to a number of topics in this area, such as enumeration, graph theory, Latin squares and designs. It is aimed at second-year undergr