Discrete Mathematics for Computer Science An Example-Based Introduction | Mathematics

Product Description

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors such as algorithms number representations logic set theory Boolean algebra functions combinatorics algorithmic complexity graphs and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background and to aid with the…