000 | 01438nam a22002057a 4500 | ||
---|---|---|---|
999 |
_c297230 _d297230 |
||
020 | _a9780074631133 | ||
082 |
_a511.1 _bTRE.D |
||
100 | _aTremblay, J P | ||
100 | _aManohar, R | ||
245 | _aDiscrete mathematical structures with applications to computer science | ||
260 |
_aNew Delhi _bTata McGraw Hill Publishing Co. Ltd. _c1975 |
||
300 | _axvi, 606 pages : illustrations ; 24 cm. | ||
490 | _aMcGraw-Hill computer science series | ||
505 | _aPreface Chapter 1. Mathematical Logic Chapter 2. Set Theory Chapter 3. Algebraic Structures Chapter 4. lattices and Boolean Algebra Chapter 5. Graph Theory Chapter 6. Introduction to Computability Theory Appendix Index | ||
520 | _aThe trend is to select several topics in mathematics that are essential to the study of many computer science areas and to expose the students to the mathematical Prerequisites in some other way. A similar development has oaaured in most engineering curricula. The selection of the topics was governed by our desire to introduce most of the basic terminology used in as many advanced courses in computer science as possible. In order to motivate the students properly, we feel that it is important to consider certain application as the terminology is introduced. There are several advantages in using this approach. | ||
650 | _aMathematics | ||
650 | _aMachine theory | ||
650 | _aElectronic data processing | ||
942 | _cBK |