Discrete Math for Computer Science Students

Large book cover: Discrete Math for Computer Science Students

Discrete Math for Computer Science Students

Publisher: Dartmouth College
ISBN/ASIN: 0132122715
Number of pages: 252

It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: Discrete Mathematics with AlgorithmsDiscrete Mathematics with Algorithms
by - J. Wiley
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs...
Book cover: Mathematics for Algorithm and Systems AnalysisMathematics for Algorithm and Systems Analysis
by - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Book cover: Applied Finite MathematicsApplied Finite Mathematics
by - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.
Book cover: Discrete MathematicsDiscrete Mathematics
by - Macquarie University
Logic and sets, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, etc.