Discrete mathematics for computer science / Kenneth Bogart, Clifford Stein, Robert L. Drysdale

By:

Bogart, Kenneth P

Contributor(s):

Material type: Text

TextSeries: Mathematics across the curriculumPublication details: Emeryville, CA : Key College Pub., c2006.Description: xx, 425 p. : ill. ; 27 cmISBN:

1930190867
9781930190863

Subject(s):

DDC classification:

004.0151 22

Contents:

Counting -- Cryptography and number theory -- Reflections on logic and proof -- Induction, recursion, and recurrences -- Probability -- Graphs -- Equivalence relations and congruence relations

Summary: "Discrete Mathematics for Computer Science" is the perfect text to combine the fields of mathematics and computer science. Written by leading academics in the field of computer science, readers will gain the skills needed to write and understand the concept of proof. This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science. The book explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more. Appropriate for large or small class sizes or self study for the motivated professional reader. Assumes familiarity with data structures. Early treatment of number theory and combinatorics allow readers to explore RSA encryption early and also to encourage them to use their knowledge of hashing and trees (from CS2) before those topics are covered in this course.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Books	Main library General Stacks	004.0151 / BO.D 2006 (Browse shelf(Opens below))	1	Available		001163

Browsing Main library shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)

Previous								Next
Previous	004 / WI.U 2007 Using information technology :	004 / WI.U 2010 Using information technology :	004.0151 / BI.D 2002 Discrete mathematics /	004.0151 / BO.D 2006 Discrete mathematics for computer science /	004.0151 / HA.D 2002 Discrete mathematics for computing /	004.0151 / VE.P 2009 Practical problems in Mathematics for Information Technology /	004.019 / BA.U 2011 Usability testing essentials :	Next

Includes bibliographical references (p. 407) and index.

Counting -- Cryptography and number theory -- Reflections on logic and proof -- Induction, recursion, and recurrences -- Probability -- Graphs -- Equivalence relations and congruence relations

"Discrete Mathematics for Computer Science" is the perfect text to combine the fields of mathematics and computer science. Written by leading academics in the field of computer science, readers will gain the skills needed to write and understand the concept of proof. This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science. The book explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more. Appropriate for large or small class sizes or self study for the motivated professional reader. Assumes familiarity with data structures. Early treatment of number theory and combinatorics allow readers to explore RSA encryption early and also to encourage them to use their knowledge of hashing and trees (from CS2) before those topics are covered in this course.

There are no comments on this title.

to post a comment.