Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
"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.
Synopsis
Developed at Dartmouth University, this undergraduate textbook uses exercises to introduce cryptography and number theory, logic and proof, induction and recursion, probability, and graphs. The approach is motivated by computer science problems and features recursion trees, the relationship between induction and recursive problem decomposition, and randomized algorithms. Appropriate for undergraduate discrete mathematics courses where students have completed, or are concurrently studying, the CS2/Data Structures course. Annotation ©2005 Book News, Inc., Portland, OR