Final DRAFT 2004 --- Discrete Mathematics for Computer Science
Book information
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.
Similar books
Introduction to algorithms
ZIP
Introduction to Algorithms, fourth edition
2022 · AZW3
Solutions Manual for Introduction to Algorithms (CLRS)
2015 · PDF
Introduction to Algorithms
2022 · PDF
Introduction to Algorithms, Fourth Edition Ed 4th (Instructor Res. last of 3, High-Res Raster Pseudocode, High-Res Figures)
2022 · 7Z
Introduction to Algorithms, Fourth Edition Ed 4th (Instructor Res. n. 2 of 3, PDF of Pseudocode & Figures)
2022 · 7Z
Introduction to Algorithms, Fourth Edition Ed 4th (Instructor Res. n. 1 of 3, Lectures and Solution Manual, Solutions)
2022 · 7Z
Introduction to Algorithms
2022 · PDF