Discrete mathematics for computing
Read Online

Discrete mathematics for computing

  • 877 Want to read
  • ·
  • 41 Currently reading

Published by Addison-Wesley in Harlow .
Written in English


  • Computer science -- Mathematics.

Book details:

Edition Notes

Includes bibliographical references and index.

StatementRod Haggarty.
The Physical Object
Paginationxii, 235p. :
Number of Pages235
ID Numbers
Open LibraryOL22071552M
ISBN 100201730472

Download Discrete mathematics for computing


  Discrete Mathematics for Computing presents the essential mathematics needed for the study of computing and information systems. The subject is covered in a gentle and informal style, but without compromising the need for correct methodology/5. Discrete mathematics for computing identifier is made of two or more English words (as we have done with nondigit_detected above). The variable nondigit_detected is an example of a logical (or Boolean) variable; it may take only the values ‘true’ and ‘false’. Best Sellers in Discrete Mathematics #1. The Book of Why: The New Science of Cause and Effect Judea Pearl. out of 5 stars Hardcover. Introductory Discrete Mathematics (Dover Books on Computer Science) V. K. Balakrishnan. out of 5 stars Paperback. $ #7. The term ‘discrete mathematics’ encompasses a collection of topics that form the prerequisite mathematical knowledge for studies in computing. Many textbooks are available with the words ‘discrete mathematics’ and either ‘computing’ or ‘computer science’ in their Size: 2MB.

A Short Course in Discrete Mathematics. This book consists of six units of study: Boolean Functions and Computer Arithmetic, Logic, Number Theory and Cryptography, Sets and Functions, Equivalence and Order, Induction, Sequences and Series. Each of this is divided into two sections. Each section contains a representative selection of problems. This is a book about discrete mathematics which also discusses mathematical rea- soning and logic. Since the publication of the first edition of this book a few years ago, I came to realize that for a significant number of readers, it is their first ex- posure to the rules of . The usual tool in mathematics to do so is the notion of a set. Any collection of things, called elements, is a set. The deck of cards is a set, whose elements are the cards. The participants of the party form a set, whose elements are Alice, Bob, Carl, Diane, Eve, Frank and George (let us denote this set by P).File Size: KB. This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in many disciplines such as computer science, engineering, Business, and the sciences. Besides reading the book, students are strongly encouraged to do all the File Size: 1MB.

Discrete mathematics deals with objects that come in discrete bundles, e.g., 1 or 2 babies. In contrast, continuous mathematics deals with objects that vary continuously, e.g., inches from a wall. Think of digital watches versus analog watches (ones where the second hand loops around continuously without stopping). The content constitutes an accepted core of mathematics for computer scientists (for example, the formal methods used in computer science draw heavily on the discrete mathematical concepts covered 5/5(1). Discrete Math knowledge is needed to become adept in proving the correctness and deriving the complexity of algorithms and data structures. You will be taught those in Algo/DS books, but you can only get the mathematical proficiency by practicing just discrete math. Knuth book is very good for that. This book is designed for computer scientists with modest familiarity of mathematics who are looking to understand the more mathematical side of computing and programming concepts. Cited By Krivsha N, Krivsha V, Beslaneev Z and Butenkov S () Greedy Algorithms for Granular Computing Problems in Spatial Granulation Technique, Procedia.