• Title Discrete Mathematics for Computer Science Students
• Author(s) Kenneth P. Bogart
• Publisher: Dartmouth College (2003)
• Hardcover/Paperback N/A
• eBook PDF Files
• Language: English
• ISBN-10/ASIN: 0132122715
• ISBN-13: N/A
• Share This:  

Book Description

This book 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.

With a clear presentation of essential concepts, it provides a lucidly written introduction to discrete mathematics with abundant support for learning, and demonstrates a wide range of applications relevant to computer science majors.

• Kenneth P. Bogart was an American mathematician known for his work on preference structures and for his textbook on combinatorics. He was a professor at Dartmouth College. Before his death in 2005, Ken Bogart was in the final stages of completing an NSF-sponsored project about the teaching of Combinatorics Through Guided Discovery.

• Amazon

• Discrete and Finite Mathematics
• Graph Theory
• Combinatorics and Game Theory
• Algebra, Abstract Algebra, and Linear Algebra
• Mathematical Logic (Set Theory, etc.)
• Probability and Stochastic Processes

• Discrete Mathematics for Computer Science Students (Kenneth P. Bogart)
• The Mirror Site (1) - PDF

• Discrete Structures for Computer Science: Counting, Recursion, and Probability
• Applied Discrete Structures (Ken Levasseur, et al)
• Discrete Mathematics with Algorithms (M. O. Albertson, et al)
• Exploring Discrete Mathematics With Maple (Kenneth H. Rosen)