**Mathematical Structures for Computer Science by Judith L. Gersting ::** A course in discrete structures (discrete mathematics) played a crucial role in Curriculum 68, the very first ACM computer science Curriculum development Guide: This course introduces the scholar to those fundamental algebraic, logical, and combinatoric concepts from mathematics needed within the subsequent computer science courses and shows the applications of those concepts to varied areas through mobile computing, wireless networks, robotics, computer game , 3-D graphics, the web …) to the joint ACM/IEEE-CS computer science Curricula 2013, where—still—discrete structures are of fundamental importance.

The topics in discrete structures are within the areas of knowledge structures and algorithms but appears elsewhere in computer science also. For example, an ability to create and understand a proof—either a proper symbolic proof or a less formal databases, and cryptography.

This Seventh Edition was guided by Curricula 2013, and virtually all of the Tier 1 and Tier 2 topics for discrete structures are included. Covering all those topics can fill a one-semester course, but there’s certainly enough material during this edition to form for a really respectable two-semester course. However much we as instructors may even see the worth during this foundational course, it’s a difficult experience for several students, who often view it as a series

of unconnected topics with little or no application to the remainder of their chosen field of study.

**Author of “Mathematical Structures for Computer Science 7th Edition“ is Judith L. Gersting**