Discrete Mathematics for Computer Science (Free PDF)

File Size: 8.11 Mb

As the discipline of computer science has matured, it has become clear that a study of discrete mathematical topics is an essential part of the computer science major. The course in discrete structures has two primary aims. The first is to introduce students to the rich mathematical structures that naturally describe much of the content of the computer science discipline, including many structures that are frequently used in modeling and implementing solutions to problems. The second is to help students develop the skills of mathematical reasoning to learn new concepts and material in computer science. This learning takes place not only while they are students but also after graduation and throughout their professional life.

During the past few years, researchers in areas of computer science as diverse as the analysis of algorithms, database systems, and artificial intelligence have made everincreasing use of discrete mathematical structures to clarify and explain key concepts and problems. As a reflection of this emphasis, careful discussions of applications such as a relational database system, the complexity of a computation, and normal forms of propositions are included in this text. The discussions of these topics build on a strong, focused development of fundamental ideas about sets, logic, relations, and functions as well as graph theory and combinatorics.

CHAPTER 1: Sets, Proof Templates, and Induction
CHAPTER 2: Formal Logic
CHAPTER 3: Relations
CHAPTER 4: Functions
CHAPTER 5: Analysis of Algorithms
CHAPTER 6: Graph Theory
CHAPTER 7: Counting and Combinatorics
CHAPTER 8: Discrete Probability
CHAPTER 9: Recurrence Relations

Author Details
"Gary Haggard"
Bucknell University

"John Schlipf"
University of Cincinnati

"Sue Whitesides"
McGill University

Download Drive-1

You May Also Like These E-Books:-

No comments:

Post a Comment