000			03518cam a2200397 a 4500
001			135
003			BD-DhEWU
005			20190118020001.0
008			020425r2003 ii a g b 001 0 eng d
010			_a2002070890
020			_a0072424346 (acidfree paper)
020			_a9780072424348
020			_a0071198814
035			_a(OCoLC)49719375
040			_aDLC _cDLC _dDLC _dBD-DhEWU _beng
041			_aeng
050	0	0	_aQA39.3 _b.R67 2003
082	0	4	_a511 _2 _bROD 2003
100	1		_aRosen, Kenneth H. _96939
245	1	0	_aDiscrete mathematics and its applications / _cKenneth H. Rosen.
250			_a5th ed.
260			_aBoston ; _aNew Delhi : _bTata McGraw-Hill, _cc2003.
300			_axxi, (various pagings) : _bill. ; _c26 cm.
504			_aIncludes bibliographic references and indexes.
505			_tTOC _aThe foundations: logic and proof, sets, and functions : Logic ; Propositional equivalences ; Predicates and quantifiers ; Nested quantifiers ; Methods of proof ; Sets ; Set operations ; Functions -- The fundamentals: algorithms, the integers, and matrices : Algorithms ; The growth of functions ; Complexity of algorithms ; The integers and division ; Applications of number theory ; Matrices -- Mathematical reasoning, induction, and recursion : Proof strategy ; Sequences and summations ; Mathematical induction ; Recursive definitions and structural induction ; Recursive algorithms ; Program correctness -- Counting : The basics of counting ; The pigeonhole principle ; Permutations and combinations ; Binomial coefficients ; Generalized permutations and combinations ; Generating permutations and combinations -- Discrete probability : An introduction to discrete probability ; Probability theory ; Expected value and variance -- Advanced counting techniques : Recurrence relations ; Solving recurrence relations ; Divide-and-conquer algorithms and recurrence relations ; Generating functions ; Inclusion-exclusion ; Applications of inclusion-exclusion -- Relations : Relations and their properties ; n-ary relations and their applications ; Representing relations ; Closures of relations ; Equivalence relations ; Partial orderings -- Graphs : Introduction to graphs ; Graph terminology ; Representing graphs and graph isomorphism ; Connectivity ; Euler and Hamilton paths ; Shortest-path problems ; Planar graphs ; Graph coloring -- Trees : introduction to trees ; Applications of trees ; Tree traversal ; Spanning trees ; Minimum spanning trees -- Boolean algebra : Boolean functions ; Representing Boolean functions ; Logic gates ; Minimization of circuits -- Modeling computation : Languages and grammars ; Finite-state machines with output ; Finite-state machines with no output ; Language recognition ; Turing machines -- Appendixes : A.1. Exponential and logarithmic functions ; A.2. Pseudocode.
520			_aThis text] is appropriate for a one- or two-term introductory discrete mathematics course to be taken by students in a wide variety of majors, including computer science, mathematics, and engineering. College Algebra is the only explicit prerequisite.-Pref.
526			_aBA
590			_aSaifun Momota
650		0	_aMathematics. _96954
650		0	_aComputer science _xMathematics. _96955
856	4	2	_3WorldCat details _uhttp://www.worldcat.org/title/discrete-mathematics-and-its-applications/oclc/49719375&referer=brief_results
856	4	2	_3E-book Fulltext _uhttp://lib.ewubd.edu/ebook/135
942			_2ddc _cTEXT _068
999			_c135 _d135
999			_c135 _d135
999			_c135 _d135