Discrete Math for Computer Science Students
This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science.
Tag(s): Discrete Mathematics
Publication date: 13 Mar 2010
ISBN-10: 013212271
ISBN-13: 9780132122719
Paperback: 344 pages
Views: 13,358
Discrete Math for Computer Science Students
This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science.
Publication date: 13 Mar 2010
ISBN-10: 013212271
ISBN-13: 9780132122719
Paperback: 344 pages
Views: 13,358
Document Type: N/A
Publisher: Addison-Wesley
License: n/a
Post time: 25 Jun 2016 04:00:00
"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.
The download links are available at the bottom of the course webpage.
Tweet
About The Author(s)
Kenneth P. Bogart (1943 - 2005) was a professor in the Mathematics Department at Dartmouth College. Before his death in 2005, he was in the final stages of completing an NSF-sponsored project about the teaching of combinatorics through Guided Discovery.
Kenneth P. Bogart (1943 - 2005) was a professor in the Mathematics Department at Dartmouth College. Before his death in 2005, he was in the final stages of completing an NSF-sponsored project about the teaching of combinatorics through Guided Discovery.
Robert Lewis (Scot) Drysdale, III is a Professor in the Department of Computer Science at Dartmouth College. He's currently working on applications of Voronoi diagrams and Delaunay triangulations. He retired from his teaching position on April 2016.
Robert Lewis (Scot) Drysdale, III is a Professor in the Department of Computer Science at Dartmouth College. He's currently working on applications of Voronoi diagrams and Delaunay triangulations. He retired from his teaching position on April 2016.
Clifford Stein is Professor of IEOR and of Computer Science at Columbia University. His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology.
Clifford Stein is Professor of IEOR and of Computer Science at Columbia University. His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology.