Mathematics for Algorithm and Systems Analysis

Front Cover
Courier Corporation, 2005 - Mathematics - 248 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Other editions - View all

Common terms and phrases

About the author (2005)

Williamson was Professor of Mathematics at the University of California, San Diego, from 1965 to 1991, and has been Professor of Computer Science at the University of California, San Diego, from 1991 to present.

Bibliographic information