Discrete mathematics for computer science /

""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 teache...

Descripción completa

Detalles Bibliográficos
Autor principal: Bogart, Kenneth P.
Otros Autores: Stein, Clifford, 1965-, Drysdale, Robert L., 1951-
Formato: Libro
Lenguaje:Inglés
Publicado: Emeryville, CA : Key College, c2006.
Colección:Mathematics across the curriculum
Materias:
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 02370cam a22003374a 4500
001 99895233004151
005 20241030105319.0
008 050223s2006 caua b 001 0 eng
010 |a  2005043351 
020 |a 1930190867 
020 |a 9781930190863 
035 |a (OCoLC)58563043 
035 |a (OCoLC)ocm58563043  
040 |a DLC  |c DLC  |d YDXCP  |d BAKER  |d IXA  |d OCLCO  |d U@S 
042 |a pcc 
049 |a U@SA 
050 0 0 |a QA76.9.M35  |b B64 2006 
082 0 0 |a 004/.01/51  |2 22 
100 1 |a Bogart, Kenneth P. 
245 1 0 |a Discrete mathematics for computer science /  |c Kenneth Bogart, Clifford Stein, Robert L. Drysdale. 
260 |a Emeryville, CA :  |b Key College,  |c c2006. 
300 |a xx, 425 p. :  |b il. ;  |c 27 cm. 
490 1 |a Mathematics across the curriculum 
504 |a Incluye referencias bibliográficas (p. 407) e índice. 
505 0 |a Preface -- To the Student -- To the Instructor -- The vision of mathematics across the curriculum -- 1. Counting -- 2. Cryptography and number theory -- 3. Reflections on logic and proof -- 4. Induction, recursion, and recurrences -- 5. Probability -- 6. Graphs -- Appendix A. Equivalence relations and congruence relations -- Appendix B. Answers and hints to selected problems. 
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." --Descripción del editor. 
650 0 |a Computer science  |x Mathematics. 
650 7 |a Computación  |x Matemáticas.  |2 UDESA 
700 1 |a Stein, Clifford,  |d 1965- 
700 1 |a Drysdale, Robert L.,  |d 1951- 
830 0 |a Mathematics across the curriculum