|
|
G.P. McKeown, V.J.Rayward- Smith, V.J. Rayward-Smith
ISBN: 9780333488553
Format: Paperback
Publisher:Palgrave Macmillan
Write a review
This is a valuable text and reference for first and second year undergraduate students of computer science. It will also appeal to postgraduates and practising computer scientists as a useful reference source. The book provides a thorough review of a broad range of the mathematics required by the serious student of computer science. It presents both the continuous and discrete mathematics required in computing and the text is organised for easy reference …
This text gives a description of the fundamental mathematical concepts used by computer scientists, while also emphasizing the need for careful justification. It provides proofs of all the major results, and all the algorithms presented are developed carefully and their performance analyzed. Throughout, the aim is to provide a well-balanced treatment of both the discrete and continuous mathematics that should be studied by the serious student of computer science. The book should therefore be most suited to those undergraduate programmes that put the emphasis on such areas as programming language semantics, program correctness, and algorithm analysis and design.
| ISBN | 0333488555 | | Pages | 416 | | ISBN13 | 9780333488553
(What's this?) | | Weight (grammes) | 696 | | Publisher | Palgrave Macmillan | | Published in | Basingstoke | | Imprint | Palgrave Macmillan | | Series editor | Sumner, F.H. | | Format | Paperback | | Series title | Macmillan Computer Science S. | | Publication date | 05 Jul 1995 | | Height (mm) | 234 | | DEWEY | 510.240904 | | Width (mm) | 156 | | DEWEY edition | DC21 | | Academic level | Undergraduate, Postgraduate, Professional / Scholarly |
|
| |
| | | Preface | | | | 1 | | Fundamentals | | 1 | | 1.1 | | Sets | | 1 | | 1.2 | | Numbers | | 15 | | 1.3 | | Vectors | | 33 | | 1.4 | | Matrices | | 49 | | 1.5 | | Algebraic Structures | | 66 | | 2 | | Functions and Relations | | 91 | | 2.1 | | Introduction to Functions | | 91 | | 2.2 | | Sequences and Recursion | | 112 | | 2.3 | | Functions Over the Reals | | 132 | | 2.4 | | Functional Programming | | 158 | | 2.5 | | Relations | | 182 | | 3 | | Logic | | 217 | | 3.1 | | Propositional Logic | | 217 | | 3.2 | | Predicate Calculus: Syntax and Semantics | | 236 | | 3.3 | | Applications of Logic in Computer Science | | 256 | | 3.4 | | Boolean Algebra | | 274 | | 4 | | Algorithm Analysis Techniques | | 291 | | 4.1 | | Systems of Linear Equations | | 291 | | 4.2 | | Probability | | 307 | | 4.3 | | Techniques for Solving Recurrence Relations | | 343 | | 4.4 | | Algorithm Analysis | | 369 | | | | Index | | 395 |
|
|
|
|
|
Enlarge
