000			01542pam a2200229a 44500
008			150502b2006 xxu||||| |||| 00| 0 eng d
020			_a9788181288240
040			_cBITS Pilani Hyderabad _aBITS Pilani Hyderabad
041			_aENG
082			_a004.0151 BOG-K
100			_aBogart, Kenneth P.
245			_aDiscrete mathematics for computer science / _cKenneth Bogart, Clifford Stein and Robert L. Drysdale
260			_aIndia _bSpringer _c2006
300			_a425 p.
365			_aINR _b695.00.
500			_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.
650			_aComputer science --Mathematics.
700			_aStein, Clifford
700			_aDrysdale, Robert L.
907			_a004.0151 BOG-K
942			_2ddc
999			_c8251 _d8251