headerdesktop laponiatimer12noi25

MAI SUNT 00:00:00:00

MAI SUNT

X

headermobile laponiatimer12noi25

MAI SUNT 00:00:00:00

MAI SUNT

X

Promotii popup img

🎁Vacanță CADOU în Laponia

Acasă la Moș Crăciun

Comandă și câștigă

Valabilitate: 11-12 noiembrie»»»

A Short Course in Discrete Mathematics

De (autor): Edward A. Bender

A Short Course in Discrete Mathematics - Edward A. Bender

A Short Course in Discrete Mathematics

De (autor): Edward A. Bender

What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Multiple choice questions for review appear throughout the text. Original 2005 edition. Notation Index. Subject Index.
Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition.
Citește mai mult

-10%

PRP: 92.69 Lei

!

Acesta este Prețul Recomandat de Producător. Prețul de vânzare al produsului este afișat mai jos.

83.42Lei

83.42Lei

92.69 Lei

Primești 83 puncte

Important icon msg

Primești puncte de fidelitate după fiecare comandă! 100 puncte de fidelitate reprezintă 1 leu. Folosește-le la viitoarele achiziții!

Livrare in 2-4 saptamani

Descrierea produsului

What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Multiple choice questions for review appear throughout the text. Original 2005 edition. Notation Index. Subject Index.
Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition.
Citește mai mult

S-ar putea să-ți placă și

De același autor

Părerea ta e inspirație pentru comunitatea Libris!

Istoricul tău de navigare

Acum se comandă

Noi suntem despre cărți, și la fel este și

Newsletter-ul nostru.

Abonează-te la veștile literare și primești un cupon de -10% pentru viitoarea ta comandă!

*Reducerea aplicată prin cupon nu se cumulează, ci se aplică reducerea cea mai mare.

Ma abonez image one
Ma abonez image one
Accessibility Logo

Salut! Te pot ajuta?

X