Mathematics for Algorithm and Systems Analysis

Mathematics for Algorithm and Systems Analysis

3.75 (4 ratings by Goodreads)
By (author)  , By (author) 

List price: US$35.95

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


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.
show more

Product details

  • Hardback | 256 pages
  • 156 x 235mm | 354g
  • English
  • 0486788466
  • 9780486788463

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
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
show more

Rating details

4 ratings
3.75 out of 5 stars
5 25% (1)
4 50% (2)
3 0% (0)
2 25% (1)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X