Discrete MathematicsPrentice Hall, 2009 - 766 páginas For a one- or two-term introductory course in discrete mathematics.
Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh's algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization. |
Contenido
M01_JOHN3183_07_SE_C01 | 1 |
M02_JOHN3183_07_SE_C02 | 66 |
M03_JOHN3183_07_SE_C03 | 117 |
Derechos de autor | |
Otras 16 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
adjacency matrix antisymmetric assume Basis Step binary search binary tree Boolean algebra Boolean expression choose combinatorial circuit compute contains convex hull count the number defined Definition denote diagram divides domain of discourse eight-bit strings elements equal equation equivalence classes equivalence relation Euclidean algorithm Euler cycle executed false flow formula Give an example given grammar graph G greatest common divisor Hamiltonian cycle Inductive Step input integer isomorphic labeled least length loop mathematical induction matrix obtain one-to-one output pair path permutation Pigeonhole Principle points positive integer problem Problem-Solving propositional function prove quantified statement real numbers recurrence relation reflexive represents rooted tree Section Review Exercises sequence Show shown in Figure solution solve sort subgraph subset Suppose symbol symmetric Theorem transitive trominoes true upper bound vertex worst-case Write a program σο
Referencias a este libro
Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston Sin vista previa disponible - 2005 |