Mathematics for informatics and computer science / Pierre Audibert.

Format:

Book

Author/Creator:

Audibert, Pierre, 1941-

Series:

ISTE

Language:

English

Subjects (All):

Computer science--Mathematics.

Computer science.

Physical Description:

1 online resource (942 p.)

Edition:

1st ed.

Other Title:

Mathématiques appliquées à l'informatique 1, 2, 3.

Place of Publication:

London : ISTE ; Hoboken, N.J. : John Wiley, 2010.

Language Note:

English

Summary:

How many ways do exist to mix different ingredients, how many chances to win a gambling game, how many possible paths going from one place to another in a network ? To this kind of questions Mathematics applied to computer gives a stimulating and exhaustive answer. This text, presented in three parts (Combinatorics, Probability, Graphs) addresses all those who wish to acquire basic or advanced knowledge in combinatorial theories. It is actually also used as a textbook. Basic and advanced theoretical elements are presented through simple applications like the Sudoku game, search engine al

Contents:

Cover; Mathematics for Informatics and Computer Science; Title Page; Copyright Page; Table of Contents; General Introduction; Chapter 1. Some Historical Elements; 1.1. Yi King; 1.2. Flavor combinations in India; 1.3. Sand drawings in Africa; 1.4. Galileo's problem; 1.5. Pascal's triangle; 1.6. The combinatorial explosion: Abu Kamil's problem, the palm grove problem and the Sudoku grid; 1.6.1. Solution to Abu Kamil's problem; 1.6.2. Palm Grove problem, where N = 4; 1.6.3. Complete Sudoku grids; PART 1. COMBINATORICS; Part 1. Introduction; Chapter 2. Arrangements and Combinations

2.1. The three formulae2.2. Calculation of Cnp, Pascal's triangle and binomial formula; 2.3. Exercises; 2.3.1. Demonstrating formulae; 2.3.2. Placing rooks on a chessboard; 2.3.3. Placing pieces on a chessboard; 2.3.4. Pascal's triangle modulo k; 2.3.5. Words classified based on their blocks of letters; 2.3.6. Diagonals of a polygon; 2.3.7. Number of times a number is present in a list of numbers; 2.3.8. Words of length n based on 0 and 1 without any block of 1s repeated; 2.3.9. Programming: classification of applications of a set with n elements in itself following the form of their graph

3.9.1. Exercise 1: words with different successive letters3.9.2. Exercise 2: repeated purchases with a given sum of money; 3.10. Return to permutations; 3.11. Gray code; Chapter 4. Enumeration by Tree Structures; 4.1. Words of length n, based on N letters 1, 2, 3, ..., N, where each letter is followed by a higher or equal letter; 4.2. Permutations enumeration; 4.3. Derangements; 4.4. The queens problem; 4.5. Filling up containers; 4.6. Stack of coins; 4.7. Domino tiling a chessboard; Chapter 5. Languages, Generating Functions and Recurrences; 5.1. The language of words based on two letters

5.7.3. Language of words made from arrangements taken from n distinct and non-repeated letters a, b, c, etc., where these words are shorter than or equal to n

Notes:

Adapted and updated from three volumes: Combien ? Mathématiques appliquées à l'informatique 1, 2, 3 ; France : Hermes Science/Lavoisier, 2008.

Includes bibliographical references (p. [907]-910) and index.

Description based on metadata supplied by the publisher and other sources.

ISBN:

1-118-55793-X

1-118-58650-6

1-299-27737-3

1-118-58648-4

OCLC:

830161899