000			02061nam a22003737a 4500
003			IIITD
005			20241102155450.0
008			241019b |||||||| |||| 00| 0 eng d
020			_a9780534490966
035			_a(DLC) 2003107333
040			_aIIITD
082	0	0	_a510 _bEPP-D
100	1		_aEpp, Susanna S.
245	1	0	_aDiscrete mathematics with applications _cby Susanna S. Epp
250			_a3rd ed.
260			_aBelmont : _bThomson-Brooks, _c©2004
300			_axix, 775, 116, 13 p. : _bill. ; _c27 cm.
500			_aIncludes index.
505			_tChapter 1 : The logic of compound statements
505			_tChapter 2 : The logic of quantified statements
505			_tChapter 3 : Elementary number theory and methods of proof
505			_tChapter 4 : Sequences, mathematical induction, and recursion
505			_tChapter 5 : Set theory
505			_tChapter 6 : Properties of functions
505			_tChapter 7 : Properties of relations
505			_tChapter 8 : Counting and probability
505			_tChapter 9 : Theory of graphs and trees
505			_tChapter 10 : Analysis of algorthm efficiency
505			_tChapter 11 : Regular expressions and finite-state automata
505			_tChapter 12 : Appendix A Properties of the real Numbers
520			_aThis edition explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to today's science and technology.
650		0	_aMathematics.
942			_2ddc _cBK
999			_c189721 _d189721