"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.
Discrete Mathematics for Computer Science
and over one million other books are available for Amazon Kindle. Learn more
| ||||||||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Product Description
From the Back Cover
Discrete Mathematics for Computer Scientists provides computer science students the foundation they need in discrete mathematics. It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic, helping answer the age-old question, "Why do we have to learn this?"
- Suitable for either lecture-only or fully-interactive, collaborative course environments
- Intended for students who have completed, or are simultaneously studying, data structures (CS2)
- Written by leading academics in the field of computer science.
CourseSmart
Save money. Lighten your backpack. Access your textbooks anytime, from anywhere.
This title is available as an eTextbook from CourseSmart. Purchase your assigned textbook as a CourseSmart eTextbook, and stop lugging books around campus! You can also access CourseSmart eTextbooks from your iPhone.
Instructors, request your exam copies online and get instant access. Learn more at coursesmart.com.
--This text refers to the
Paperback
edition.
About the Author
Clifford Stein is a Professor of IEOR at Columbia University. He also holds an appointment in the Department of Computer Science. He is the director of Undergraduate Programs for the IEOR Department. Prior to joining Columbia, he spent 9 years as an Assistant and Associate Professor in the Dartmouth College Department of Computer Science.
His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. Professor Stein has published many influential papers in the leading conferences and journals in his field, and has occupied a variety of editorial positions including the journals ACM Transactions on Algorithms, Mathematical Programming, Journal of Algorithms, SIAM Journal on Discrete Mathematics and Operations Research Letters. His work has been supported by the National Science Foundation and Sloan Foundation. He is the winner of several prestigious awards including an NSF Career Award, an Alfred Sloan Research Fellowship and the Karen Wetterhahn Award for Distinguished Creative or Scholarly Achievement. He is also the co-author of two textbooks: Discrete Math for Computer Science with Scot Drysdale and Introduction to Algorithms, with T. Cormen, C. Leiserson and R. Rivest—the best-selling textbook in algorithms, which has been translated into 8 languages.
(Robert L.) Scot Drysdale, III is a professor of Computer Science at Dartmouth College and served as Chair of the Computer Science department for eight years. His main research area is algorithms, primarily computational geometry. He is best known for papers describing algorithms for computing variants of a geometric structure called the Voronoi Diagram and algorithms that use the Voronoi Diagram to solve other problems in computational geometry. He has also developed algorithms for planning and testing the correctness of tool path movements in Numerical Control (NC) machining. His work has been supported by grants from the National Science Foundation and Ford Motor Company and he was awarded a Fulbright Fellowship.
He has also made contributions to education. He is a winner of the Dartmouth Distinguished Teaching award. He was a member of the development committee for the AP exam in computer science for four years during its transition from C++ to Java and then chaired the committee for three years. He has been Principal Lecturer for DIMACS and NSF workshops and was co-director of a DIMACS institute. He was a faculty member of the ACM/MAA Institute for Retraining in Computer Science for five years.
--This text refers to the Paperback edition.
Inside This Book
(Learn More)
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
There are no customer reviews yet on Amazon.ca
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
1.8 out of 5 stars
11 reviews
21 of 23 people found the following review helpful
3.0 out of 5 stars
I did not find it suitable for my discrete math course
Aug 17 2005
By Charles Ashbacher
- Published on Amazon.com
Format:Hardcover
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.
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.
4 of 5 people found the following review helpful
1.0 out of 5 stars
If I knew enough to use this book, I wouldn't need it.
Feb 4 2012
By Delmar McPherson
- Published on Amazon.com
Format:Paperback|Amazon Verified Purchase
As an experienced teacher working on a second bachelor's in preparation for a master's, I am saddened to report this is very possibly the worst textbook I have ever seen in my entire educational life.
Two words summarize the flaws in this alleged textbook: jargon and assumptions.
Every sentence sent me to the math dictionary at least twice. I continually questioned why the writer chose not to use plain language when it was suitable, possible, and appropriate.
To make matters worse, each section begins and is riddled with exercises that assume the reader's understanding of the material. Then, the writer adds insult to injury by relying on those assumptions and referencing the opening exercises as if the exercise taught you something. Whatever happened to teach, example, and exercise? Beginning and inundating the sections with exercises that preempted the scant instruction completely convoluted the entire learning process and destroyed any sense of continuity.
In the end, to use the book I first had to try to identify what the writer was trying to teach, and that wasn't always possible. After scavenging internet math dictionaries to pin down the topic, I then had to further troll the internet to find sites that taught it in a way that would help me understand the book. Even then I had to waste obscene amounts of time sifting through exercise text to isolate the relevant instruction.
Maybe this book was written for postgraduate readers, because if you didn't know the subject matter already, you're not likely learning it from this text.
Two words summarize the flaws in this alleged textbook: jargon and assumptions.
Every sentence sent me to the math dictionary at least twice. I continually questioned why the writer chose not to use plain language when it was suitable, possible, and appropriate.
To make matters worse, each section begins and is riddled with exercises that assume the reader's understanding of the material. Then, the writer adds insult to injury by relying on those assumptions and referencing the opening exercises as if the exercise taught you something. Whatever happened to teach, example, and exercise? Beginning and inundating the sections with exercises that preempted the scant instruction completely convoluted the entire learning process and destroyed any sense of continuity.
In the end, to use the book I first had to try to identify what the writer was trying to teach, and that wasn't always possible. After scavenging internet math dictionaries to pin down the topic, I then had to further troll the internet to find sites that taught it in a way that would help me understand the book. Even then I had to waste obscene amounts of time sifting through exercise text to isolate the relevant instruction.
Maybe this book was written for postgraduate readers, because if you didn't know the subject matter already, you're not likely learning it from this text.
1 of 1 people found the following review helpful
1.0 out of 5 stars
Just Walk Away and Get Rosen's Discrete Mathematics and its Applications
May 2 2013
By Lauren
- Published on Amazon.com
Format:Paperback
After struggling for the first month or two in my discrete math course using this book, I turned to the Rosen on course reserves and came to the conclusion that the prof who decided to use the Stein, Drysdale, and Bogart must either be a sadist or really have no idea how people learn. Or perhaps he never read the course description. The book recommends that students already be familiar with computer programming while the course I am taking required only calc 1. In general I feel very let down by whoever chose this book, as I learned later on that the only reason for picking it over the Rosen (the tried and true book that had previously been on the book-list) was simply that the Rosen was too heavy.
If it were just that the SBD is difficult to understand at times I wouldn't be writing this- after all, it's still a technical subject and one can expect that sort of thing. But the book's inadequacy is so pervasive that even simple, intuitive concepts are made complicated. What adds insult to injury is the very wanting exercise sections at the back of each section- no more than 15 or so problems.
I broke down a week ago and bought my own copy of Rosen's Discrete Mathematics and its Applications. I think it was the best decision I made all term and I only wish I had done so sooner. Two to three times the examples per section and generally more sections (so a wider and deeper coverage than SDB). Far more intuitive language, not to mention the more reasonable notation style. And most importantly, whereas SDB stops after giving proofs, Rosen goes into how to actually compute things.
First thing I'm doing after finals is burning the SDB, after that I'll bury its ashes in an unmarked grave. I wouldn't try to sell it anywhere because I'm not evil and I don't want someone else to have to struggle through it.
If it were just that the SBD is difficult to understand at times I wouldn't be writing this- after all, it's still a technical subject and one can expect that sort of thing. But the book's inadequacy is so pervasive that even simple, intuitive concepts are made complicated. What adds insult to injury is the very wanting exercise sections at the back of each section- no more than 15 or so problems.
I broke down a week ago and bought my own copy of Rosen's Discrete Mathematics and its Applications. I think it was the best decision I made all term and I only wish I had done so sooner. Two to three times the examples per section and generally more sections (so a wider and deeper coverage than SDB). Far more intuitive language, not to mention the more reasonable notation style. And most importantly, whereas SDB stops after giving proofs, Rosen goes into how to actually compute things.
First thing I'm doing after finals is burning the SDB, after that I'll bury its ashes in an unmarked grave. I wouldn't try to sell it anywhere because I'm not evil and I don't want someone else to have to struggle through it.
›
Go to Amazon.com to see all 11 reviews
1.8 out of 5 stars
Listmania!
Look for similar items by category
- Books > Computers & Technology
- Books > New & Used Textbooks > Computer Science & Information Systems
- Books > New & Used Textbooks > Sciences > Mathematics
- Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics
- Books > Qualifying Textbooks - Fall 2007 > Science
- Books > Science & Math > Mathematics > Pure Mathematics > Discrete Mathematics
Feedback
Would you like to update product info or give feedback on images?
|
