Discrete Mathematics and Its Applications / Edition 7 by Kenneth Rosen | 9780073383095 | Hardcover | Barnes & Noble
Discrete Mathematics and Its Applications / Edition 7

Discrete Mathematics and Its Applications / Edition 7

3.0 2
by Kenneth Rosen
     
 

ISBN-10: 0073383090

ISBN-13: 9780073383095

Pub. Date: 06/14/2011

Publisher: McGraw-Hill Higher Education

Discrete Mathematics and Its Applications, Seventh 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

Overview

Discrete Mathematics and Its Applications, Seventh 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 variety of real-world applications—from Computer Science to Data Networking, to Psychology, to Chemistry, to Engineering, to Linguistics, to Biology, to Business, and many other important fields.

Product Details

ISBN-13:
9780073383095
Publisher:
McGraw-Hill Higher Education
Publication date:
06/14/2011
Edition description:
List
Pages:
1072
Sales rank:
155,357
Product dimensions:
8.80(w) x 10.60(h) x 1.60(d)

Related Subjects

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 >