Discrete Mathematics and Its Applications / Edition 6

Discrete Mathematics and Its Applications / Edition 6

by Kenneth Rosen
     
 

View All Available Formats & Editions

ISBN-10: 0073229725

ISBN-13: 9780073229720

Pub. Date: 07/26/2006

Publisher: McGraw-Hill Education

Discrete Mathematics and its Applications, Sixth Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused

Overview

Discrete Mathematics and its Applications, Sixth Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide a wide variety of real-world applications…from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields.

Product Details

ISBN-13:
9780073229720
Publisher:
McGraw-Hill Education
Publication date:
07/26/2006
Edition description:
Older Edition
Pages:
1008
Product dimensions:
8.80(w) x 10.50(h) x 1.60(d)

Table of Contents

Preface
To the Student
1 The Foundations: Logic, Sets, and Functions
1.1 Logic
1.2 Propositional Equivalences
1.3 Predicates and Quantifiers
1.4 Sets
1.5 Set Operations
1.6 Functions
1.7 Sequences and Summations
1.8 The Growth Functions
2 The Fundamentals: Algorithms, the Integers, and Matrices
2.1 Algorithms
2.2 Complexity of Algorithms
2.3 The Integers and Division
2.4 Integers and Algorithms
2.5 Applications of Number Theory
2.6 Matrice
3 Mathematical Reasoning
3.1 Methods of Proof
3.2 Mathematical Induction
3.3 Recursive Definitions
3.4 Recursive Algorithms
3.5 Program Correctness
4 Counting
4.1 The Basics of Counting
4.2 The Pigeonhole Principle
4.3 Permutations and Combinations
4.4 Discrete Probability
4.5 Probability Theory
4.6 Generalized Permutations and Combinations
4.7 Generating Permutations and Combinations
5 Advanced Counting Techniques
5.1 Recurrence Relations
5.2 Solving Recurrence Relations
5.3 Divide-and-Conquer Relations
5.4 Generating Functions
(and more...)

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >