## Discrete Mathematical StructuresFor one- or two-term 1st/2nd year-level courses in Discrete Mathematics. Combining a careful selection of topics with previews of their genuine applications in computer science, this text, more than any other book in its field, is written with an appropriate level of rigor and a strong pedagogical focus. It limits its area and coverage of topics to those that students will actually utilize, and emphasizes both basic theory and applications, giving a firm foundation for more advanced courses, as well as providing an excellent reference work for those courses. - Additional material - Provides more information on the properties of integers, including base n representations; and gives more contexts for isomorphism. - Cryptology - Begins in Chapter 1, then fully explained throughout the book, ending with section 11.3, Algebraic Structures and Cryptology. - Coverage of coding - Covers all of its aspects, including efficiency, effectiveness, and security. - New exercises in each chapter - includes approximately 25 percent more exercises than in the 4th edition. - Additional student experiments - Included for weighted voting systems, Petri nets, and Catalan numbers. - Concise, well-written |

### What people are saying - Write a review

User Review - Flag as inappropriate

good

User Review - Flag as inappropriate

fine

### Other editions - View all

Discrete Mathematical Structures Bernard Kolman,Robert C. Busby,Sharon Cutler Ross No preview available - 2004 |

### Common terms and phrases

algorithm array binary operation Boolean algebra called closure code words colors congruence relation Consider construct contains corresponding coset cycle decoding defined denoted described determine digit digraph edges elements encoding function equivalence relation Euler circuit Euler path Example false finite set finite-state machine Give given grammar Hamiltonian circuit Hasse diagram Hence homomorphism identity input integers inverse isomorphic labeled language lattice least Let G mathematical induction matrix monoid Moore machine multiplication node partial order partition path of length permutation pigeonhole polynomial poset positive integer Prim's algorithm proof properties Prove pseudocode quotient real numbers recurrence relation reflexive regular expression represent result Section semigroup sequence shown in Figure Solution statement Step string structure subroutine subset subtree Suppose symbol symmetric relation syntax diagram Theorem transitive true truth table undirected vertex vertices Write