Newsletter   Secure Checkout   View Cart (0 items)  
Search:    Welcome Guest! Save up to 30-40% on most items with our awesome everyday discounts!

Discrete Mathematics for Computer Science (Mathematics Across the Curriculum) [Hardcover]

Our Price $ 62.97  
Retail Value $ 89.95  
You Save $ 26.99  (30%)  
Item Number 263994  
Buy New $62.97
Out Of Stock!
Currently Out Of Stock
Currently unavailable...

Item description for Discrete Mathematics for Computer Science (Mathematics Across the Curriculum) by Kenneth Bogart, Clifford Stein, Robert L. Drysdale, Young, William F., Jr., M.D., Tommy Lee Edwards & Barnett Newman...

"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!

Item Specifications...

Pages   425
Est. Packaging Dimensions:   Length: 1" Width: 8" Height: 10"
Weight:   2.5 lbs.
Binding  Hardcover
Release Date   Sep 27, 2005
Publisher   Key College
ISBN  1930190867  
ISBN13  9781930190863  

Availability  0 units.

More About Kenneth Bogart, Clifford Stein, Robert L. Drysdale, Young, William F., Jr., M.D., Tommy Lee Edwards & Barnett Newman

Register your artisan biography and upload your photo! Bogart-Dartmouth College

Kenneth Bogart currently resides in Hanover, in the state of New Hampshire.

Are You The Artisan or Author behind this product?
Improve our customers experience by registering for an Artisan Biography Center Homepage.

Product Categories

1Books > Subjects > Computers & Internet > General
2Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Discrete Mathematics
3Books > Subjects > Science > General
4Books > Subjects > Science > Mathematics > General
5Books > Subjects > Science > Mathematics > Pure Mathematics > Discrete Mathematics

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.

Write your own review about Discrete Mathematics for Computer Science (Mathematics Across the Curriculum)

Ask A Question or Provide Feedback regarding Discrete Mathematics for Computer Science (Mathematics Across the Curriculum)

Item Feedback and Product Questions
For immediate assistance call 888.395.0572 during the hours of 10am thru 8pm EST Monday thru Friday and a customer care representative will be happy to help you!

Help us continuously improve our service by reporting your feedback or questions below:

I have a question regarding this product
The information above is incorrect or conflicting
The page has misspellings or incorrect grammar
The page did not load correctly in my browser or created an error.

Email Address:
Anti Spam Question. To combat spammers we require that you answer a simple question.
What color is the sky?
Leave This Blank :
Do Not Change This Text :

Add This Product Widget To Your Website

Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.

    Copy and paste the following HTML into your website and enjoy!

Order toll-free weekdays 10am thru 10pm EST by phone: 1-888-395-0572 (Lines are closed on holidays & weekends.)
Customer Service | My Account | Track My Orders | Return Policy | Request Free Catalog | Email Newsletter

Gift Certificates
RSS Feeds
About Us
Contact Us
Terms Of Use
Privacy Policy