000 02175cam a22002294a 4500
001 vtls000002711
003 VRT
005 20250102224550.0
008 081202s2002 enka |b 001 0 eng
020 _a0201730472 (pbk.)
039 9 _a201402040109
_bVLOAD
_c201004110921
_dmalmash
_c200812060938
_dvenkatrajand
_c200812020832
_dNoora
_y200812020832
_zNoora
050 0 0 _aQA76.9.M35
_bH34 2002
100 1 _aHaggarty, Rod.
_943822
245 1 0 _aDiscrete Mathematics for Computing /
_cRod Haggarty.
260 _aHarlow, England ;
_aNew York :
_bAddison-Wesley,
_cc2002.
300 _axii, 235 p. :
_bill. ;
_c24 cm.
504 _aIncludes bibliographical references (p. 232) and index.
505 _a1. Introduction 2. Logic and Proof 3. Set Theory 4. Relations 5. Functions 6. Combinatorics 7. Graphs 8. Directed Graphs 9. Boolean Algebra Application: Designing a 2-Bit Adder
520 _aThis book is a short, concise introduction to key mathematical ideas for computing students which develops their understanding of discrete mathematics and its application in computing. The topics are presented in a well defined, logical order that build upon each other and are constantly reinforced by worked examples. Reliance on students' previous mathematical experience is kept to a minimum, though some basic algebraic manipulation is required. This book is appropriate for CS and Math students in an undergraduate Discrete Math course. The content constitutes an accepted core of mathematics for computer scientists (for example, the formal methods used in computer science draw heavily on the discrete methematical concepts covered here, particularly logic, sets, relations and functions). Emphasis is placed on clear and careful explanations of basic ideas and on building confidence in developing mathematical competence through carefully selected exercises. All chapters conclude with short applications/case studies relevant to computing, which provide further motivation to engage with the mathematical ideas involved, and also demonstrate how the mathematics can be applied in a computing context.
650 0 _aComputer science
_xMathematics.
_95846
942 _2lcc
_n0
_cBK
999 _c20141
_d20141