An edition of Discrete mathematics (1985)

Discrete mathematics

3rd ed.

by

  • ★ ★ 1.7 (3 ratings)
  • 46 Want to read
  • 3 Currently reading
  • 1 Have read
Cover of: Discrete mathematics by Kenneth A. Ross, Kenneth A. Ross
Preview Only

My Reading Lists:

Create a new list
Notes
  • ★ ★ 1.7 (3 ratings)
  • 46 Want to read
  • 3 Currently reading
  • 1 Have read
Notes

Check nearby libraries

Buy this book

Last edited by MARC Bot
July 31, 2025 | History
Edit
An edition of Discrete mathematics (1985)

Discrete mathematics

3rd ed.

by

  • ★ ★ 1.7 (3 ratings)
  • 46 Want to read
  • 3 Currently reading
  • 1 Have read

This third edition offers an introduction to discrete mathematics, covering relations, induction, counting techniques, logic and graphs. More advanced topics of Boolean algebra and permutation groups are included, and there are numerous examples to reinforce the material. Informal but thorough in its coverage, this introduction to discrete mathematics offers a carefully graded treatment of the basics essential to computer science.

Publish Date
Publisher
Prentice Hall
Language
English
Pages
753

Check nearby libraries

Buy this book

Previews available in: English

Subjects

Informatique, Problems, exercises, Textbooks, Mathématique discrète, Diskrete Mathematik, Computer science, Data processing, Mathématiques, Mathematics, Mathematics textbooks, Computer science, mathematics, Discrete groups

Times

1961-

Showing 2 featured editions. View all 11 editions?

Edition Availability
Cover of: Discrete mathematics
Discrete mathematics
2012, McGraw-Hill
Hardcover
Cover of: Discrete mathematics
Discrete mathematics
1992, Prentice Hall
in English - 3rd ed.

Add another edition?

Book Details

Table of Contents

1. Sets, Sequences and Functions
Page 1
1.1. Some Special Sets
Page 1
1.2. Set Operations
Page 9
1.3. Functions
Page 19
1.4. Inverses of Functions
Page 29
1.5. Sequences
Page 36
1.6. Big-Oh Notation
Page 44
2. Elementary Logic
Page 55
2.1. Informal Introduction
Page 55
2.2. Propositional Calculus
Page 66
2.3. Methods of Proof
Page 77
2.4. More Propositional Calculus
Page 83
2.5. Analysis of Arguments
Page 95
3. Relations
Page 107
3.1. Relations
Page 107
3.2. Digraphs and Graphs
Page 113
3.3. Matrices
Page 123
3.4. Multiplication of Matrices
Page 133
3.5. Equivalence Relations and Partitions
Page 142
3.6. The Division Algorithm and Z(p)
Page 152
4. Induction and Recursion
Page 164
4.1. Loop Invariants
Page 164
4.2. Mathematical Induction
Page 178
4.3. Recursive Definitions
Page 188
4.4. Recurrence Relations
Page 198
4.5. More Induction
Page 207
4.6. The Euclidean Algorithm
Page 213
5. Counting
Page 226
5.1. Basic Counting Techniques
Page 226
5.2. Elementary Probability
Page 235
5.3. Inclusion-Exclusion Principle and Binomial Methods
Page 245
5.4. Counting and Partitions
Page 254
5.5. Pigeon-Hole Principle
Page 263
6. Introduction to Graphs and Trees
Page 275
6.1. Graphs
Page 275
6.2. Edge Traversal Problems
Page 286
6.3. Trees
Page 296
6.4. Rooted Trees
Page 303
6.5. Vertex Traversal Problems
Page 313
6.6. Minimum Spanning Trees
Page 321
7. Recursion, Trees and Algorithms
Page 335
7.1. General Recursion
Page 335
7.2. Recursive Algorithms
Page 347
7.3. Depth-First Search Algorithms
Page 358
7.4. Polish Notation
Page 375
7.5. Weighted Trees
Page 383
8. Digraphs
Page 399
8.1. Digraphs
Page 399
8.2. Weighted Digraphs
Page 409
8.3. Digraph Algorithms
Page 420
8.4. Modifications and Applications of the Algorithms
Page 431
9. Probability
Page 439
9.1. Independence
Page 439
9.2. Random Variables
Page 451
9.3. Expectation and Standard Deviation
Page 462
9.4. Binomial and Related Distributions
Page 474
10. Boolean Algebra
Page 488
10.1. Boolean Algebras
Page 488
10.2. Boolean Expressions
Page 500
10.3. Logic Networks
Page 509
10.4. Karnaugh Maps
Page 519
11. More Relations
Page 529
11.1. Partially Ordered Sets
Page 529
11.2. Special Orderings
Page 542
11.3. Properties of General Relations
Page 552
11.4. Closures of Relations
Page 563
12. Algebraic Structures
Page 573
12.1. Permutations
Page 573
12.2. Groups Acting on Sets
Page 583
12.3. Groups Acting on Sets, Part 2
Page 591
12.4. Applications to Coloring Problems
Page 600
12.5. Groups
Page 611
12.6. The Fundamental Homomorphism Theorem
Page 623
12.7. Semigroups
Page 633
12.8. Other Algebraic Systems
Page 643
13. Predicate Calculus and Infinite Sets
Page 658
13.1. Quantifiers
Page 658
13.2. Elementary Predicate Calculus
Page 665
13.3. Infinite Sets
Page 674
Dictionary
Page 685
Answers and Hints
Page 688
Index
Page 747

Edition Notes

Includes index.

Published in
Englewood Cliffs, N.J

Classifications

Dewey Decimal Class
511
Library of Congress
QA76.9.M35 R67 1992

The Physical Object

Pagination
xiv, 753 p. :
Number of pages
753

Edition Identifiers

Open Library
OL1548517M
ISBN 10
0132181576
LCCN
91028006
OCLC/WorldCat
24211874
LibraryThing
188715
Goodreads
4250457

Work Identifiers

Work ID
OL837648W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Loading indicator
Loading carousel
Loading indicator
Loading carousel

History

Download catalog record: RDF / JSON
July 31, 2025 Edited by MARC Bot import existing book
August 18, 2020 Edited by ImportBot import existing book
August 2, 2020 Edited by ImportBot import existing book
February 13, 2020 Edited by MARC Bot remove fake subjects
December 9, 2009 Created by WorkBot add works page