Discrete Mathematics for New Technology, Second EditionCRC Press, 1 Δεκ 2001 - 749 σελίδες Updated and expanded, Discrete Mathematics for New Technology, Second Edition provides a sympathetic and accessible introduction to discrete mathematics, including the core mathematics requirements for undergraduate computer science students. The approach is comprehensive yet maintains an easy-to-follow progression from the basic mathematical ideas to the more sophisticated concepts examined in the latter stages of the book. Although the theory is presented rigorously, it is illustrated by the frequent use of pertinent examples and is further reinforced with exercises-some with hints and solutions-to enable the reader to achieve a comprehensive understanding of the subject at hand. New to the Second Edition Presenting material that is at the foundations of mathematics itself, Discrete Mathematics for New Technology is a readable, friendly textbook designed for non-mathematicians as well as for computing and mathematics undergraduates alike. |
Περιεχόμενα
XIV | 42 |
XVI | 43 |
XVII | 47 |
XVIII | 61 |
XIX | 71 |
XXII | 77 |
XXIII | 83 |
XXIV | 92 |
XXV | 96 |
XXVI | 103 |
XXVII | 114 |
XXVIII | 126 |
XXIX | 146 |
XXXII | 156 |
XXXIII | 163 |
XXXIV | 167 |
XXXV | 180 |
XXXVI | 190 |
XXXVII | 197 |
XXXVIII | 212 |
XL | 230 |
XLI | 238 |
XLII | 252 |
XLIII | 262 |
XLIV | 269 |
XLV | 283 |
XLVII | 286 |
XLVIII | 288 |
LXI | 371 |
LXII | 376 |
LXIII | 388 |
LXIV | 396 |
LXV | 410 |
LXVI | 429 |
LXVIII | 433 |
LXIX | 440 |
LXX | 457 |
LXXI | 466 |
LXXII | 473 |
LXXIII | 485 |
LXXIV | 498 |
LXXV | 512 |
LXXVI | 519 |
LXXVII | 528 |
LXXVIII | 537 |
LXXIX | 548 |
LXXXI | 549 |
LXXXII | 563 |
LXXXIII | 580 |
LXXXIV | 589 |
LXXXV | 597 |
LXXXVI | 610 |
LXXXVII | 624 |
| 628 | |
LXXXIX | 725 |
Συχνά εμφανιζόμενοι όροι και φράσεις
A₁ adjacency matrix algorithm anti-symmetric attribute axioms b₁ bijection binary operation binary tree Boolean algebra Boolean expression candidate key Cartesian product Cayley table codeword column complete graph Consider corresponding cycle defined definition denote diagram digraph directed graph disjunctive normal form elementary matrix elementary row operations equivalence classes equivalence relation Eulerian example exercise f x1 figure finite function f given go f Hamiltonian Hence identity element im(f induction infinite Integer inverse isomorphic label least element Let f linear equations List the elements logically equivalent mathematical minimal minterms modulo morphism multiplication non-empty partial order partition path positive integers postcondition proof prove real numbers record instances represented result rooted tree Show Solution sort tree spanning tree subgroup subset subtree Suppose surjective switches symmetric theorem third normal form total order true truth values type Set unique V₁ variables vertices weighted graph zero
Αναφορές για αυτό το βιβλίο
Mathematik für Wirtschaftswissenschaftler Thomas Holey,Armin Wiedemann Δεν υπάρχει διαθέσιμη προεπισκόπηση - 2007 |
