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