Synopses & Reviews
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 the field 2s many applications. It consists of four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory. Each unit is divided into four sections, and each section contains a selection of problems that vary in difficulty. Multiple-choice questions for review appear at the end of each unit. This text serves as a companion to Dover 2s A Short Course in Discrete Mathematics. 256pp. 61/8 x 91/4.
Synopsis
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 four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Synopsis
Discrete mathematics is fundamental to computer science, and interesting, challenging problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, artificial intelligence, theoretical computer science, and elsewhere. This up-to-date text prepares undergraduates with four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory. Each unit is divided into four sections, and each section contains a selection of problems that vary in difficulty. Solutions to these problems are given at the end of the text.
Multiple-choice questions for review appear at the end of each unit. The text offers students the mathematical language and sophistication to recognize and articulate the ideas behind these questions and to answer questions similar in concept and difficulty. Those who master the necessary ideas and mathematical language to understand these review questions gain the ability to formulate, in the neutral language of mathematics, the problems that arise in various applications of computer science--a skill that enables them to discuss problems in discrete mathematics with other computer scientists and with mathematicians.
Synopsis
A companion to the recent Dover publication A Short Course in Discrete Mathematics, this new, original text offers undergraduates in computer science an intensive survey of the field's fundamentals: counting and listing, functions, decision trees and recursion, and graph theory.
Synopsis
Discrete mathematics is fundamental to computer science, and this text covers its ideas and mathematical language. Features counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Table of Contents
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