Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications. It consists of 4 units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Basic Counting and Listing Section 1: Lists with Repetitions Section 2: Lists Without Repetition Section 3: Sets Section 4: Probability and Basic Counting Functions Section 1: Some Basic Terminology Section 2: Permutations Section 3: Other Combinatorial Aspects of Functions Section 4: Functions and Probability Decision Trees and Recursion Section 1: Basic Concepts of Decision Trees Section 2: Recursive Algorithms Section 3: Decision Trees and Conditional Probability Section 4: Inductive Proofs and Recursive Equations Basic Concepts in Graph Theory Section 1: What is a Graph? Section 2: Digraphs, Paths, and Subgraphs Section 3: Trees Section 4: Rates of Growth and Analysis of Algorithms Solutions to Exercises Notation Index Subject Index
Edward A. Bender, S. Gill Williamson
Dover Publications Inc.
Place of Publication
Country of Publication
MATHEMATICS FOR ALGORITHM & SY
Dover Books on Mathematics