Mathematics for Algorithm and Systems Analysis

Mathematics for Algorithm and Systems Analysis

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

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?


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

Product details

  • Paperback | 256 pages
  • 155 x 234 x 13mm | 349g
  • New York, United States
  • English
  • Illustrations, unspecified
  • 0486442500
  • 9780486442501
  • 1,797,744

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