| 000 | 04791cam a2200637Mi 4500 | ||
|---|---|---|---|
| 001 | ocn830161899 | ||
| 003 | OCoLC | ||
| 005 | 20240523125535.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130316s2013 enk o 000 0 eng d | ||
| 040 |
_aEBLCP _beng _epn _cEBLCP _dYDXCP _dMHW _dDG1 _dOCLCF _dOCLCQ _dDEBSZ _dOCLCQ _dDEBBG _dOCLCQ _dDG1 _dLIP _dMERUC _dOCLCQ _dZCU _dOCLCQ _dICG _dOCLCQ _dU3W _dOCLCQ _dDKC _dOCLCQ _dHS0 _dOCLCO _dOCLCQ _dOCLCO _dOCLCL |
||
| 019 | _a992921148 | ||
| 020 |
_a9781118557938 _q(electronic bk.) |
||
| 020 |
_a111855793X _q(electronic bk.) |
||
| 020 | _z9781118586501 | ||
| 020 | _z1118586506 | ||
| 029 | 1 |
_aAU@ _b000055878967 |
|
| 029 | 1 |
_aCHBIS _b010026785 |
|
| 029 | 1 |
_aCHNEW _b000941521 |
|
| 029 | 1 |
_aCHVBK _b480217971 |
|
| 029 | 1 |
_aDEBBG _bBV043395650 |
|
| 029 | 1 |
_aDEBBG _bBV044050106 |
|
| 029 | 1 |
_aDEBSZ _b400440857 |
|
| 029 | 1 |
_aDEBSZ _b431355983 |
|
| 029 | 1 |
_aNZ1 _b15915946 |
|
| 035 |
_a(OCoLC)830161899 _z(OCoLC)992921148 |
||
| 050 | 4 |
_aQA76.9.M35 _bA83 2013 |
|
| 082 | 0 | 4 | _a004.0151 |
| 049 | _aMAIN | ||
| 100 | 1 |
_aAudibert, Pierre, _d1941- _1https://id.oclc.org/worldcat/entity/E39PBJwxHBDwgmdTbhxmp9RHYP |
|
| 245 | 1 | 0 |
_aMathematics for informatics and computer science / _cPierre Audibert. |
| 260 |
_aLondon : _bWiley, _c2013. |
||
| 300 | _a1 online resource (942 pages) | ||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 | _aISTE | |
| 500 | _a5.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. | ||
| 520 | _aHow 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. | ||
| 588 | 0 | _aPrint version record. | |
| 505 | 0 | _aCover; 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 | |
| 505 | 8 | _a2.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 | |
| 505 | 8 | _a3.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 | |
| 590 |
_aJohn Wiley and Sons _bWiley Online Library: Complete oBooks |
||
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 6 |
_aInformatique _xMath�ematiques. |
|
| 650 | 7 |
_aComputer science _xMathematics _2fast |
|
| 758 |
_ihas work: _aMathematics for informatics and computer science (Text) _1https://id.oclc.org/worldcat/entity/E39PCGbmYHFQmBPJcbkBJ4ckjC _4https://id.oclc.org/worldcat/ontology/hasWork |
||
| 776 | 0 | 8 |
_iPrint version: _aAudibert, Pierre. _tMathematics for Informatics and Computer Science. _dLondon : Wiley, �2013 _z9781848211964 |
| 830 | 0 | _aISTE. | |
| 856 | 4 | 0 | _uhttps://onlinelibrary.wiley.com/doi/book/10.1002/9781118557938 |
| 938 |
_aEBL - Ebook Library _bEBLB _nEBL1143507 |
||
| 938 |
_aYBP Library Services _bYANK _n10349642 |
||
| 994 |
_a92 _bINLUM |
||
| 999 |
_c11910 _d11910 |
||