DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, Metric Edition explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to today's science and technology.

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 transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.

Stein/Drysdale/Bogart's Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course. Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using motivating, relevant CS applications. This text takes an active-learning approach where activities are presented as exercises and the material is then fleshed out through explanations and extensions of the exercises.

Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE with Student Solutions Manual CD-ROM! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mathematics will help you develop important reasoning skills that will continue to be useful throughout your career.

Computer science abounds with applications of discrete mathematics, yet s- dents of computer science often study discrete mathematics in the context of purely mathematical applications. They have to ?gure out for themselves how to apply the ideas of discrete mathematics to computing problems. It is not easy. Most students fail to experience broad success in this enterprise, which is not surprising, since many of the most important advances in science and engineeringhavebeen, precisely, applicationsofmathematicstospeci?cscience and engineering problems. Tobesure,mostdiscretemathtextbooksincorporatesomeaspectsapplying discrete math to computing, but it usually takes the form of asking students to write programs to compute the number of three-ball combinations there are in a set of ten balls or, at best, to implement a graph algorithm. Few texts ask students to use mathematical logic to analyze properties of digital circuits or computer programs or to apply the set theoretic model of functions to understand higher-order operations. A major aim of this text is to integrate, tightly, the study of discrete mathematics with the study of central problems of computer science.

Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science. The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs. The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.

Computer science majors taking a non-programming-based course like discrete mathematics might ask 'Why do I need to learn this?' Written with these students in mind, this text introduces the mathematical foundations of computer science by providing a comprehensive treatment of standard technical topics while simultaneously illustrating some of the broad-ranging applications of that material throughout the field. Chapters on core topics from discrete structures – like logic, proofs, number theory, counting, probability, graphs – are augmented with around 60 'computer science connections' pages introducing their applications: for example, game trees (logic), triangulation of scenes in computer graphics (induction), the Enigma machine (counting), algorithmic bias (relations), differential privacy (probability), and paired kidney transplants (graphs). Pedagogical features include 'Why You Might Care' sections, quick-reference chapter guides and key terms and results summaries, problem-solving and writing tips, 'Taking it Further' asides with more technical details, and around 1700 exercises, 435 worked examples, and 480 figures.

Written exclusively with computer science students in mind, Discrete Mathematics for Computer Science provides a comprehensive treatment of standard course topics for the introductory discrete mathematics course with a strong emphasis on the relationship between the concepts and their application to computer science. The book has been crafted to enhance teaching and learning ease and includes a wide selection of exercises, detailed exploration problems, examples and problems inspired by wide-ranging applications of computer science and handy quick reference guides for key technical topics throughout. Discrete Mathematics for Computer Science provides a lucidly written introduction to discrete mathematics with abundant support for learning, including over 450 examples, thorough chapter summaries, simple quizzes, and approximately 1600 homework exercises of widely varying difficulty. Each chapter begins with motivational content that relates the chapter topic to computer science practice and the book also includes over fifty "Computer Science Connections" which discuss applications to computer science such as Rotation Matrices; Game Trees, Logic, and Winning Tic-Tac(-Toe); Moore's Law; Secret Sharing; The Enigma Machine and the First Computer; Bayesian Modeling and Spam Filtering; and Quantum Computing.

This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition.