Discrete Mathematics for Computer Science
Key College Publishing
1st Edition
Published on 8. February 2006
Book
Hardback
400 pages
978-1-930190-86-3 (ISBN)
Description
"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.
More details
Edition
1., 2006
Language
English
Place of publication
Emeryville
United States
Target group
College/higher education
Lower undergraduate
Illustrations
70 s/w Abbildungen
70 black & white illustrations
Dimensions
Height: 25.4 cm
Width: 20.3 cm
ISBN-13
978-1-930190-86-3 (9781930190863)
Schweitzer Classification
Content
Introduction.- Counting.- Cryptography and Number Theory.- Reflections on Logic and Proof.- Induction, Recursion and Recurrences.- Probability.- Graphs.