This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.

The color images and text in this book have been converted to grayscale.

"About this title" may belong to another edition of this title.

Store Description

Family-run business of true bibliophiles, with a hand-curated inventory of the finest titles. We believe in the beauty of books--not just in their words, but in the elegance, timelessness, even the smell of a well-kept piece. As such, we strive to keep nothing on our shelves you wouldn't be proud to put on yours.

Visit Seller's Storefront

Seller's business information

Fulano Books
MA, U.S.A.

Terms of Sale:

We adhere to all AbeBooks terms of sale policies.

We adhere to AbeBooks's standard cancellation policy in all but very exceptional cases (abuse, fraud). You can also and always reach out to us directly. We have a responsive staff ready to help you resolve any issues.

Shipping Terms:

Standard shipping is USPS media mail unless otherwise selected. All items are sent in heavy duty bubble-padded mailers. Heavier and larger items are mailed in boxes with appropriate wrap to ensure safe delivery.

Payment Methods
accepted by seller

Add to Wants

Items related to Mathematics for Computer Science

Mathematics for Computer Science

Lehman, Eric; Leighton, F Thomson; Meyer, Albert R

New - Soft cover

Seller's business information