000			02210cam a2200313 a 4500
008			081026s2006 caua b 001 0 eng
010			_a2005043351
020			_a1930190867
020			_a9781930190863
035			_a(Sirsi) u942
040			_aEG-CaNU _cEG-CaNU _dEG-CaNU
042			_ancode
082	0	0	_a004.0151 _2 22
100	1		_aBogart, Kenneth P. _916870
245	1	0	_aDiscrete mathematics for computer science / _c Kenneth Bogart, Clifford Stein, Robert L. Drysdale
260			_aEmeryville, CA : _b Key College Pub., _c c2006.
300			_axx, 425 p. : _b ill. ; _c 27 cm.
490	0		_aMathematics across the curriculum
504			_aIncludes bibliographical references (p. 407) and index.
505	0		_aCounting -- Cryptography and number theory -- Reflections on logic and proof -- Induction, recursion, and recurrences -- Probability -- Graphs -- Equivalence relations and congruence relations
520			_a"Discrete Mathematics for Computer Science" is the perfect text to combine the fields of mathematics and computer science. Written by leading academics in the field of computer science, readers will gain the skills needed to write and understand the concept of proof. This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science. The book explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more. Appropriate for large or small class sizes or self study for the motivated professional reader. Assumes familiarity with data structures. Early treatment of number theory and combinatorics allow readers to explore RSA encryption early and also to encourage them to use their knowledge of hashing and trees (from CS2) before those topics are covered in this course.
630	0	0	_aBioinformatics _9475
650		0	_aComputer science _x Mathematics. _916871
700	1		_aStein, Clifford, _d 1965- _914346
700	1		_aDrysdale, Robert L., _d 1951- _916873
596			_a1
999			_c8357 _d8357