Mathematics for Computer Science Eric Lehman, Frank Thomson Leighton and Albert R. Meyer

By:

Lehman, Eric

Contributor(s):

Material type: Text

TextLanguage: Eng Publication details: Penguin Random House 2017 IndiaDescription: 998p. ; 23 CMISBN:

9781680921229

Subject(s):

DDC classification:

004.0151 LEH

Summary: 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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Materials specified	Status	Date due	Barcode
Books	Rashtriya Raksha University	004.0151 LEH (Browse shelf(Opens below))		Available		9965

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

There are no comments on this title.

to post a comment.