Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3151204 obálek a 950590 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Discrete Mathematics (4th Edition)
Rok: 1999
ISBN: 9780130961419
OKCZID: 110060539
Citace (dle ČSN ISO 690):
ROSS, Kenneth A. Discrete mathematics. 4th ed. Upper Saddle River: Prentice Hall, c1999. xiv, 684 s.
Hodnocení:
1.5 / 5
(6 hlasů)
Anotace
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 algebraic structures have been eliminated, though the chapter on counting includes two sections on elementary probability. *The section on big-oh notation is now in the chapter on induction where it is also closer to the algorithmic applications *Chapters devoted to probability and algebraic structures have been eliminated, though the chapter on counting includes two sections on elementary probability *Proofs of all important results are given in the body of the text presentation itself, not as exercises, so serious students can study the proofs or keep the book as a reference *Hundreds of examples illustrate new ideas, tie abstract concepts to concrete settings, and build up to moderately complex uses of new methods