000			01697nam a2200253Ia 4500
999			_c18327 _d18327
003			VITAP
005			20200313150305.0
008			170725s9999 xx 000 0 und d
020			_a9789332550490
040			_cVITAP
041			_aEnglish
082			_223rd _a511.156 MOT
100			_aMott, Joe L. _97860
245		0	_aDiscrete Mathematics for Computer Scientists and Mathematicians / _cJoe L.Mott, Abraham Kandel and Theodore P. Baker
250			_a2nd Ed.
260			_bPearson India Education Services Pvt. Ltd. _aChennai _c2019
300			_bBook _axiv, 751p. : ill. ; _c24cm
500			_aIt includes bibliography and index This is a lucidly written fine-tuned introduction to discrete mathematics. It is eminently suited for students pursuing BCA, MCA and B.E./B.Tech courses. Considering the importance of the subject, quite a number of universities have sought to introduce discrete mathematics as a core subject in the engineering curriculum. FEATURES > Comprehensive discussions on graph theory, mathematical induction, Boolean algebras, logic and other proof techniques and recurrence relations have been dealt with. > Gives good insights into graphs as a modelling tool. > Gives better understanding of computer solutions of differential equations. > Many worked out examples and solutions follow each section.
600		0	_98564 _aBaker, Theodore P.
653			_aAlgebra, Boolean ;Combinatorial Analysis; Computer Science—Mathematics; Graph Theory
700			_aKandel, Abraham _98565
856			_uhttps://pearsoned.co.in/web/books/9789332550490_DISCRETE-MATHEMATICS-FOR-COMPUTER-SCIENTISTS_-MOTT.aspx
942			_cBK _2ddc _h511.156 MOT