Discrete Mathematical Structures

Front Cover
Pearson Prentice Hall, 2004 - Computers - 503 pages
For 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

From inside the book

What people are saying - Write a review

User Review - Flag as inappropriate

good

User Review - Flag as inappropriate

fine

Contents

Chapter
6
Lonic
50
Counting
78
Copyright

19 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information