Item description for Discrete Mathematics for Computer Science (Mathematics Across the Curriculum) by Kenneth Bogart, Clifford Stein & Robert L. Drysdale...
"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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 1" Width: 8" Height: 10" Weight: 2.5 lbs.
Release Date Sep 8, 2005
Publisher Key College
ISBN 1930190867 ISBN13 9781930190863
Availability 0 units.
More About Kenneth Bogart, Clifford Stein & Robert L. Drysdale
Kenneth Bogart currently resides in Hanover, in the state of New Hampshire.
Reviews - What do customers think about Discrete Mathematics for Computer Science (Mathematics Across the Curriculum)?
I did not find it suitable for my discrete math course Aug 17, 2005
I evaluated this book for possible adoption in a course in introductory discrete mathematics. My decision was that I would not use it in the course. One primary reason is that there are no sections devoted to set theory and functions. Most of the introductory material in these areas is included in the book, but only in conjunction with other topics, such as counting, solving recurrences and computing probabilities. In my experience, students need to be exposed to the material as a point of emphasis, rather than embedded inside other topics. The first chapter introduces the basic principles of counting, permutations, combinations, binomial coefficients and a section on equivalence relations that is considered optional. This is because it is not used again in later chapters, something I don't agree with. Chapter two deals with cryptography and number theory. While I have no objection to this material in a discrete mathematics course, I prefer that it be put off to the latter part of the course. In chapter three, the logic of propositions and predicates as well as the laws of inference are examined. I generally prefer more coverage of these areas. Chapter four is 84 pages and covers induction, recursion and recurrence relations. Taking up approximately one fourth of the book, the coverage is complete. Probability is covered in chapter 5 and graph theory in chapter 6. The coverage in both is fairly typical, so I have no positive or negative comments on either one. Relations are covered in depth in an appendix. Solutions to the odd exercises are included in an appendix. Since I prefer to start my discrete mathematics course by covering set theory, functions and logic, I have removed this book for adoption consideration.