English
LOOKING TO PLACE A BULK ORDER?CLICK HERE
Piracy-free
Assured Quality
Secure Transactions
Fast Delivery
Sustainably Printed
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Piracy-free
Assured Quality
Secure Transactions
Fast Delivery
Sustainably Printed
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
About The Book
Description
Author
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.
Details
ISBN 13
9789888407064
Publication Date
-08-03-2017
Pages
-988
Weight
-2241 grams
Dimensions
-216x280x52.76 mm
