English | 2021 | ISBN: 0367549891 | 270 Pages | PDF | 20 MB
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.
Download:
http://usafiles.net/1RVn/Discrete_Mathematics_for_Computer_Science.pdf