An edition of Discrete Mathematics and Its Applications (1988)

Discrete Mathematics and Its Applications

by

  • ★★★★ ★ 4.8 (5 ratings)
  • 278 Want to read
  • 22 Currently reading
  • 11 Have read
Cover of: Discrete Mathematics and Its Applications by Kenneth H. Rosen, Kenneth H. Rosen
Preview Only

My Reading Lists:

Create a new list
Notes
  • ★★★★ ★ 4.8 (5 ratings)
  • 278 Want to read
  • 22 Currently reading
  • 11 Have read
Notes

Check nearby libraries

Buy this book

Last edited by Mehedi Hasan Munna581
September 24, 2025 | History
Edit
An edition of Discrete Mathematics and Its Applications (1988)

Discrete Mathematics and Its Applications

by

  • ★★★★ ★ 4.8 (5 ratings)
  • 278 Want to read
  • 22 Currently reading
  • 11 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Mcgraw-Hill College
Language
English
Pages
832

Check nearby libraries

Buy this book

Previews available in: English

Subjects

Mathematics, Computer science, Computer science, mathematics, Informatique, Logique symbolique et mathématique, Symbolic and mathematical Logic, Mathématiques, Combinatória, Computer science--mathematics, Qa39.3 .r67 2003, 511, Informatique--mathématiques, Qa39.2 .r654 1999, Logic, symbolic and mathematical, Qa39.3 .r67 2007

Showing 5 featured editions. View all 20 editions?

Edition Availability
Cover of: Discrete Mathematics and Its Applications
Discrete Mathematics and Its Applications: And Its Applications
January 5, 2006, McGraw-Hill Higher Education
in English
Cover of: Discrete mathematics and its applications
Discrete mathematics and its applications
1999, WCB/McGraw-Hill
in English - 4th ed.
Cover of: Discrete mathematics and its applications
Discrete mathematics and its applications
1999, McGraw-Hill
in English - 4. ed.
Cover of: Discrete Mathematics and Its Applications
Discrete Mathematics and Its Applications
March 1995, Mcgraw-Hill College
in English
Cover of: Discrete mathematics and its applications
Discrete mathematics and its applications
Publisher unknown
- 2nd ed.

Add another edition?

Book Details

Table of Contents

Preface
Page xi
To the Student
Page xxi
1. The Foundations: Logic, Sets, and Functions
Page 1
1.1. Logic
Page 1
1.2. Propositional Equivalences
Page 13
1.3. Predicates and Quantifiers
Page 21
1.4. Sets
Page 37
1.5. Set Operations
Page 46
1.6. Functions
Page 58
1.7. Sequences and Summations
Page 71
1.8. The Growth of Functions
Page 79
Key Terms and Results
Page 89
Review Questions
Page 92
Supplementary Exercises
Page 93
Computer Projects
Page 95
Computations and Explorations
Page 95
Writing Projects
Page 96
2. The Fundamentals: Algorithms, the Integers, and Matrices
Page 97
2.1. Algorithms
Page 98
2.2. Complexity of Algorithms
Page 104
2.3. The Integers and Division
Page 111
2.4. Integers and Algorithms
Page 126
2.5. Applications of Number Theory
Page 136
2.6. Matrices
Page 150
Key Terms and Results
Page 162
Review Questions
Page 163
Supplementary Exercises
Page 164
Computer Projects
Page 166
Computations and Explorations
Page 166
Writing Projects
Page 167
3. Mathematical Reasoning
Page 168
3.1. Methods of Proof
Page 169
3.2. Mathematical Induction
Page 183
3.3. Recursive Definitions
Page 201
3.4. Recursive Algorithms
Page 211
3.5. Program Correctness
Page 217
Key Terms and Results
Page 224
Review Questions
Page 225
Supplementary Exercises
Page 226
Computer Projects
Page 229
Computations and Explorations
Page 229
Writing Projects
Page 230
4. Counting
Page 231
4.1. The Basics of Counting
Page 232
4.2. The Pigeonhole Principle
Page 243
4.3. Permutations and Combinations
Page 250
4.4. Discrete Probability
Page 261
4.5. Probability Theory
Page 268
4.6. Generalized Permutations and Combinations
Page 282
4.7. Generating Permutations and Combinations
Page 293
Key Terms and Concepts
Page 298
Review Questions
Page 300
Supplementary Exercises
Page 301
Computer Projects
Page 305
Computations and Explorations
Page 305
Writing Projects
Page 306
5. Advanced Counting Techniques
Page 307
5.1. Recurrence Relations
Page 307
5.2. Solving Recurrence Relations
Page 318
5.3. Divide-and-Conquer Relations
Page 325
5.4. Inclusion-Exclusion
Page 332
5.5. Applications of Inclusion-Exclusion
Page 339
Key Terms and Results
Page 349
Review Questions
Page 350
Supplementary Exercises
Page 351
Computer Projects
Page 353
Computations and Explorations
Page 353
Writing Projects
Page 354
6. Relations
Page 355
6.1. Relations and Their Properties
Page 355
6.2. n-ary Relations and Their Applications
Page 366
6.3. Representing Relations
Page 373
6.4. Closures of Relations
Page 381
6.5. Equivalence Relations
Page 393
6.6. Partial Orderings
Page 402
Key Terms and Results
Page 419
Review Questions
Page 421
Supplementary Exercises
Page 422
Computer Projects
Page 426
Computations and Explorations
Page 427
Writing Projects
Page 427
7. Graphs
Page 429
7.1. Introduction to Graphs
Page 429
7.2. Graph Terminology
Page 437
7.3. Representing Graphs and Graph Isomorphism
Page 449
7.4. Connectivity
Page 462
7.5. Euler and Hamilton Paths
Page 472
7.6. Shortest Path Problems
Page 488
7.7. Planar Graphs
Page 499
7.8. Graph Coloring
Page 509
Key Terms and Results
Page 520
Review Questions
Page 522
Supplementary Exercises
Page 523
Computer Projects
Page 528
Computations and Explorations
Page 529
Writing Projects
Page 529
8. Trees
Page 531
8.1. Introduction to Trees
Page 531
8.2. Applications of Trees
Page 547
8.3. Tree Traversal
Page 554
8.4. Trees and Sorting
Page 571
8.5. Spanning Trees
Page 580
8.6. Minimum Spanning Trees
Page 593
Key Terms and Results
Page 600
Review Questions
Page 602
Supplementary Exercises
Page 603
Computer Projects
Page 606
Computations and Explorations
Page 607
Writing Projects
Page 607
9. Boolean Algebra
Page 608
9.1. Boolean Functions
Page 609
9.2. Representing Boolean Functions
Page 616
9.3. Logic Gates
Page 621
9.4. Minimization of Circuits
Page 629
Key Terms and Results
Page 645
Review Questions
Page 646
Supplementary Exercises
Page 646
Computer Projects
Page 649
Computations and Explorations
Page 649
Writing Projects
Page 650
10. Modeling Computation
Page 651
10.1. Languages and Grammars
Page 652
10.2. Finite-State Machines with Output
Page 663
10.3. Finite-State Machines with No Output
Page 672
10.4. Language Recognition
Page 682
10.5. Turing Machines
Page 694
Key Terms and Results
Page 703
Review Questions
Page 704
Supplementary Exercises
Page 705
Computer Projects
Page 708
Computations and Explorations
Page 709
Writing Projects
Page 709
Appendixes
Page A-0
A.1. Exponential and Logarithmic Functions
Page A-0
A.2. Pseudocode
Page A-3
A.3. Generating Functions
Page A-9
Suggested Readings
Page B-0
Solutions to Odd-Numbered Exercises
Page S-1
Index of Biographies
Page I-0
Index
Page I-1

Classifications

Library of Congress
QA39.2 .R654 1995

Edition Identifiers

Open Library
OL7296593M
ISBN 10
0070539650
ISBN 13
9780070539655
LCCN
95000942
OCLC/WorldCat
31971051
LibraryThing
43673
Goodreads
1836931

Work Identifiers

Work ID
OL31821W

Source records

Community Reviews (2)

Length 1 Short 100% Purpose 1 Learn about 100%

Lists

Loading indicator
Loading carousel
Loading indicator
Loading carousel

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
September 24, 2025 Edited by Mehedi Hasan Munna581 Update covers
September 24, 2025 Edited by Mehedi Hasan Munna581 Update covers
September 13, 2025 Edited by Drini Add TOC from Tocky
August 1, 2024 Edited by MARC Bot import existing book
April 29, 2008 Created by an anonymous user Imported from amazon.com record