Fr. 24.90

Mathematics for Algorithm and Systems Analysis

English · Paperback / Softback

Shipping usually within 1 to 3 weeks (not available at short notice)

Description

Read more

Klappentext Discrete mathematics is fundamental to computer science, and this text covers its ideas and mathematical language. Features counting and listing, functions, decision trees and recursion, and basic concepts of graph theory. Inhaltsverzeichnis Basic Counting and ListingSection 1: Lists with RepetitionsSection 2: Lists Without RepetitionSection 3: SetsSection 4: Probability and Basic CountingFunctionsSection 1: Some Basic TerminologySection 2: PermutationsSection 3: Other Combinatorial Aspects of FunctionsSection 4: Functions and ProbabilityDecision Trees and RecursionSection 1: Basic Concepts of Decision TreesSection 2: Recursive AlgorithmsSection 3: Decision Trees and Conditional ProbabilitySection 4: Inductive Proofs and Recursive EquationsBasic Concepts in Graph TheorySection 1: What is a Graph?Section 2: Digraphs, Paths, and SubgraphsSection 3: TreesSection 4: Rates of Growth and Analysis of AlgorithmsSolutions to ExercisesNotation IndexSubject Index

Product details

Authors Edward A Bender, Edward a Williamson Bender, Edward A. Bender, Edward A. Williamson Bender, S Gill Williamson, S. Gill Williamson
Publisher Dover Publications Inc.
 
Languages English
Product format Paperback / Softback
Released 16.11.2011
 
EAN 9780486442501
ISBN 978-0-486-44250-1
No. of pages 256
Series Dover Books on Mathematics
Dover Books on Mathematics
Dover Books on MaTHEMA 1.4tics
Subject Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.