P�ginas: 988 G�neros: 12:JNU:Teaching of a specific subject 12:UFM:Mathematical & statistical software 12:KJQ:Business mathematics & systems Sinopsis: 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._,

Rese�a del editor:

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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

We have 20 years experience selling books worldwide! Friendly customer support. Your satisfaction guaranteed!

Ver la p�gina web de la librer�a