Mathematical structures for computer science: discrete mathematics and its applications
Fast forward 45 years or so (through mobile computing, wireless networks, robotics, virtual reality, 3-D graphics, the Internet …) to the joint ACM/IEEE-CS Computer Science Curricula 2013, where—still—discrete structures are of fundamental importance. “The material in discrete structures is pervasive in the areas of data structures and algorithms but ap-pears elsewhere in computer science as well. For example, an ability to create and understand a proof—either a formal symbolic proof or a less formal but still mathematically rigorous argument—is important in virtually every area of computer science, including (to name just a few) formal specification, verification, databases, and cryptography. Graph theory concepts are used in networks, operating systems, and compilers. Set theory concepts are used in software engineering and in databases. Probability theory is used in intelligent systems, networking, and a number of computing applications.
This Seventh Edition was guided by Curricula 2013, and virtually all of the Core Tier 1 and Tier 2 topics for discrete structures from that document are included. Covering all those topics can fill a one-semester course, but there is certainly enough material in this edition to make for a very respectable two-semester course.