000			02088nam a2200265 a 4500
001			vtls000066461
003			KUKTEM
005			20251125093555.0
008			121119t2012 si a f 001 0 eng d
020			_a9789814340502
039		9	_a201306131522 _bsaini _y201211191142 _zida
040			_aUMP
090			_aQA76.9.M35 K46 2012
100	1		_aKhoussainov, Bakhadyr
245	1	0	_aLectures on discrete mathematics for computer science / _cBakhadyr Khoussainov and Nodira Khoussainova
260			_aSingapore : _bWorld Scientific Pub., _c2012
300			_axvi, 346 p. : _bill. ; _c24 cm.
490	1		_aAlgebra and discrete mathematics, _x1793-5873 ; _vv. 3
505	0		_a1. Definitions, theorems, and proofs -- 2. Proof methods -- 3. Integers and divisibility -- 4. Euclidean algorithm and congruence relations -- 5. Secret message passing -- 6. Basics of directed graphs -- 7. The path problem and undirected graphs -- 8. Circuit problems in graphs -- 9. Rooted trees -- 10. Sets and operations on sets -- 11. Relations on sets -- 12. Equivalence relations and partial orders -- 13. Databases and relational structures -- 14. Relational calculus -- 15. Program correctness through loop invariants -- 16. Induction and recursion -- 17. Spanning trees -- 18. Shortest paths in directed weighted graphs -- 19. Games played on finite graphs -- 20. Functions -- 21. Types of functions -- 22. Syntax of propositional logic -- 23. Semantics of propositional logic -- 24. Normal forms and the SAT problem -- 25. Deterministic finite automata -- 26. Designing finite automata -- 27. Nondeterministic finite automata -- 28. The subset construction -- 29. Regular expressions and finite automata -- 30. Algorithms for finite automata -- 31. Counting principles -- 32. Permutations and combinations -- 33. Basics of probability
650		0	_aComputer science _xMathematics _vTextbooks
700	1		_aKhoussainova, Nodira
830		0	_aAlgebra and discrete mathematics ; _vv. 3
999			_aVIRTUA40 _c65991 _d65997
999			_aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*4900*5050*6500*7000*8300*9992
942	0	0	_05