| Edition |
3rd ed. |
| Description |
xiv, 753 pages : illustrations (some color) ; 25 cm. |
| Series |
Prentice-Hall International editions
|
| Note |
Includes index. |
| Summary |
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. |
| Contents |
Sets, sequences and functions -- Elementary logic -- Relations -- Induction and recursion -- Counting -- Introduction to graphs and trees -- Recursion, trees and algorithms -- Digraphs -- Probability -- Boolean algebra -- More relations -- Algebraic structures -- Predicate calculus and infinite sets. |
| Form |
Also issued online. |
| Subject |
Computer science -- Mathematics.
|
|
mathématique discrète.
|
|
Computer science -- Mathematics.
(OCoLC)fst00872460
|
|
Diskrete Mathematik.
|
| Indexed Term |
Mathematics |
| Added Author |
Wright, Charles R. B., 1937-
|
| Other Form: |
Online version: Ross, Kenneth A. Discrete mathematics. 3rd ed. Englewood Cliffs, N.J. : Prentice Hall, ©1992 (OCoLC)622807370 |
| ISBN |
0132181576 |
|
9780132181570 |
|
0132182076 (paperback) |
|
9780132182072 (paperback) |
|
