did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9780486442501

Mathematics for Algorithm and Systems Analysis

by ;
  • ISBN13:

    9780486442501

  • ISBN10:

    0486442500

  • Format: Paperback
  • Copyright: 2011-11-24
  • Publisher: Dover Publications

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $19.15 Save up to $4.50
  • Rent Book $14.65
    Add to Cart Free Shipping Icon Free Shipping

    TERM
    PRICE
    DUE
    USUALLY SHIPS IN 2-3 BUSINESS DAYS
    *This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.

Supplemental Materials

What is included with this book?

Summary

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.

Table of Contents

Unit CL: Basic Counting and Listing
Lists with Repetitions
1(8)
Lists Without Repetition
9(4)
Sets
13(15)
Probability and Basic Counting
28(17)
Multiple Choice Questions for Review
41(4)
Unit Fn: Functions
Some Basic Terminology
45(6)
Permutations
51(7)
Other Combinatorial Aspects of Functions
58(7)
Functions and Probability
65(24)
Multiple Choice Questions for Review
85(4)
Unit DT: Decision Trees and Recursion
Basic Concepts of Decision Trees
89(14)
Recursive Algorithms
103(12)
Decision Trees and Conditional Probability
115(13)
Inductive Proofs and Recursive Equations
128(17)
Multiple Choice Questions for Review
140(5)
Unit GT: Basic Concepts in Graph Theory
What is a Graph?
145(12)
Digraphs, Paths, and Subgraphs
157(11)
Trees
168(13)
Rates of Growth and Analysis of Algorithms
181(18)
Multiple Choice Questions for Review
195(4)
Solutions to Exercises 199(40)
Notation Index 239(2)
Subject Index 241

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program