Skip to content

Mathematics for Algorithm and Systems Analysis

ISBN-10: 0486442500

ISBN-13: 9780486442501

Edition: 2005

Authors: Edward A. Bender, S. Gill Williamson

List price: $17.95
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


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.
Customers also bought

Book details

List price: $17.95
Copyright year: 2005
Publisher: Dover Publications, Incorporated
Publication date: 11/24/2011
Binding: Paperback
Pages: 256
Size: 6.25" wide x 9.25" long x 0.50" tall
Weight: 0.748
Language: English

Unit CL: Basic Counting and Listing
Lists with Repetitions
Lists Without Repetition
Probability and Basic Counting
Multiple Choice Questions for Review
Unit Fn: Functions
Some Basic Terminology
Other Combinatorial Aspects of Functions
Functions and Probability
Multiple Choice Questions for Review
Unit DT: Decision Trees and Recursion
Basic Concepts of Decision Trees
Recursive Algorithms
Decision Trees and Conditional Probability
Inductive Proofs and Recursive Equations
Multiple Choice Questions for Review
Unit GT: Basic Concepts in Graph Theory
What is a Graph?
Digraphs, Paths, and Subgraphs
Rates of Growth and Analysis of Algorithms
Multiple Choice Questions for Review
Solutions to Exercises
Notation Index
Subject Index