Mathematics for Algorithm and Systems Analysis (Dover Books on Mathematics)

Bender, Edward A.; Williamson, S. Gill

ISBN 10: 0486442500 / ISBN 13: 9780486442501

Edité par Dover Publications, 2011

A propos de cet article

This item is in overall good condition. Covers and dust jackets are intact but may have minor wear including slight curls or bends to corners as well as cosmetic blemishes including stickers. Pages are intact but may have minor highlighting/ writing. Binding is intact; however, spine may have slight wear overall. Digital codes may not be included and have not been tested to be redeemable and/or active. Minor shelf wear overall. Please note that all items are donated goods and are in used condition. Orders shipped Monday through Friday! Your purchase helps put people to work and learn life skills to reach their full potential. Orders shipped Monday through Friday. Your purchase helps put people to work and learn life skills to reach their full potential. Thank you! N° de réf. du vendeur 466OE30045IT

Détails bibliographiques

Titre : Mathematics for Algorithm and Systems ...

Éditeur : Dover Publications

Date d'édition : 2011

Reliure : Couverture souple

Etat : Good

A propos de ce titre

Synopsis :

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.

Présentation de l'éditeur:

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.