Mathematics for Algorithm and Systems Analysis

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. 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. This text serves as a companion to Dover's A Short Course in Discrete Mathematics.