Bookbot
Wyprzedane, ale poszukiwane!
Czy masz to w bibliotece?Zarób między 130,74 zł a 161,35 zł sprzedając tę książkę.
Sprzedać książki

Matematyka dyskretna

Parametry

  • 899 stron
  • 32 godziny czytania

Więcej o książce

The distinguishing characteristic of Ross and Wright is a sound mathematical treatment that increases smoothly in sophistication. The book presents utility-grade discrete math tools so students can understand them, use them, and move on to more advanced mathematical topics. *NEW-An introductory section giving gentle, motivated warm-up questions that point out the importance of precision, examples, and abstraction as problem-solving tools. *NEW-Dependence on previous mathematical background and sophistication is reduced to give students with rusty skills a better chance at understanding the new ideas in discrete mathematics. *NEW-The chapter on elementary logic is extensively revised to place even more emphasis on logical thinking. *NEW-A revised presentation makes algorithms easier to translate into object-oriented programs. *NEW-Some long sections have been broken up. In particular, the account of Boolean algebras is substantially reworked to keep the abstract outline clear and to lead naturally to applications. *NEW-The section on big-oh notation is now in the chapter on induction where it is also closer to the algorithmic applications. *NEW-Chapters devoted to probability and al

Zakup książki

Matematyka dyskretna, Wright Charles R. B, Kenneth A. Ross

Język
Rok wydania
1996
Oprawa
(twarda)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

Nikt jeszcze nie ocenił.

Tytuł
Matematyka dyskretna
Język
polski
Rok wydania
1996
Oprawa
twarda
Liczba stron
899
ISBN10
8301121297
ISBN13
9788301121297
Seria
Tagi
Nauka
Opis
The distinguishing characteristic of Ross and Wright is a sound mathematical treatment that increases smoothly in sophistication. The book presents utility-grade discrete math tools so students can understand them, use them, and move on to more advanced mathematical topics. *NEW-An introductory section giving gentle, motivated warm-up questions that point out the importance of precision, examples, and abstraction as problem-solving tools. *NEW-Dependence on previous mathematical background and sophistication is reduced to give students with rusty skills a better chance at understanding the new ideas in discrete mathematics. *NEW-The chapter on elementary logic is extensively revised to place even more emphasis on logical thinking. *NEW-A revised presentation makes algorithms easier to translate into object-oriented programs. *NEW-Some long sections have been broken up. In particular, the account of Boolean algebras is substantially reworked to keep the abstract outline clear and to lead naturally to applications. *NEW-The section on big-oh notation is now in the chapter on induction where it is also closer to the algorithmic applications. *NEW-Chapters devoted to probability and al