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.
Citeste mai mult

-10%

PRP: 92.69 Lei

!

Acesta este Pretul Recomandat de Producator. Pretul de vanzare al produsului este afisat mai jos.

83.42Lei

83.42Lei

92.69 Lei

Primesti 83 puncte

Important icon msg

Primesti puncte de fidelitate dupa fiecare comanda! 100 puncte de fidelitate reprezinta 1 leu. Foloseste-le la viitoarele achizitii!

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.
Citeste mai mult

S-ar putea sa-ti placa si

De acelasi autor

Parerea ta e inspiratie pentru comunitatea Libris!

Acum se comanda

Noi suntem despre carti, si la fel este si

Newsletter-ul nostru.

Aboneaza-te la vestile literare si primesti un cupon de -10% pentru viitoarea ta comanda!

*Reducerea aplicata prin cupon nu se cumuleaza, ci se aplica reducerea cea mai mare.

Ma abonez image one
Ma abonez image one
Accessibility Logo