Knygos.lt klubas Knygos.lt nariams
81,05 €
-30%
Įprastai
115,79 €
Mathematics for Computer Science
Mathematics for Computer Science
Knygos.lt klubas Knygos.lt nariams
81,05 €
-30%
Įprastai
115,79 €
  • Išsiųsime per 12–18 d.d.
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 definit…
  • Leidėjas:
  • Metai: 2017
  • ISBN-10: 9888407066
  • ISBN-13: 9789888407064
  • Formatas: 21.6 x 27.9 x 5.1 cm, kieti viršeliai
  • Kalba: Anglų

Mathematics for Computer Science (el. knyga) (skaityta knyga) | knygos.lt

Atsiliepimai

(3.84 Goodreads įvertinimas)

Aprašymas

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.

Knygos.lt klubas
Knygos.lt nariams
81,05 €
-30%
Įprastai
115,79 €
Kaina registruotiems pirkėjams
Prisijunkite ir už šią prekę
gausite 1,16 Knygų Eurų!?
Išsiųsime per 12–18 d.d.
Įsigykite dovanų kuponą
Daugiau
  • Autorius: Eric Lehman
  • Leidėjas:
  • Metai: 2017
  • ISBN-10: 9888407066
  • ISBN-13: 9789888407064
  • Formatas: 21.6 x 27.9 x 5.1 cm, kieti viršeliai
  • Kalba: Anglų

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.

Atsiliepimai

  • Atsiliepimų nėra
0 pirkėjai įvertino šią prekę.
5
0%
4
0%
3
0%
2
0%
1
0%
(rodomas nebus)