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

Kenneth Bogart (Author), Clifford Stein (Author), Robert L. Drysdale (Author)

Book Description

ISBN-10: 1930190867 | ISBN-13: 978-1930190863 | Publication Date: September 8, 2005 | Edition: 1

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

Editorial Reviews

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.

Product Details

• Hardcover: 400 pages
• Publisher: Key College; 1 edition (September 8, 2005)
• Language: English
• ISBN-10: 1930190867
• ISBN-13: 978-1930190863
• Product Dimensions: 10.3 x 8.3 x 1.2 inches
• Shipping Weight: 2.4 pounds
• Average Customer Review: 3.3 out of 5 stars  See all reviews (3 customer reviews)
• Amazon Best Sellers Rank: #486,883 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

20 of 22 people found the following review helpful:

3.0 out of 5 stars I did not find it suitable for my discrete math course, August 17, 2005

By 

Charles Ashbacher (Marion, Iowa United States) - See all my reviews
(TOP 500 REVIEWER)    (VINE VOICE)    (HALL OF FAME REVIEWER)   

This review is from: Discrete Mathematics for Computer Science (Mathematics Across the Curriculum) (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.

5.0 out of 5 stars Best Mathematics Book for Computer Scientists!, December 31, 2011

By 

Nayan B. Ruparelia "nayan1" (Watford, England.) - See all my reviews
(REAL NAME)   

This review is from: Discrete Mathematics for Computer Scientists (Paperback)

I am a professional computer scientist and, having graduated from university a considerably long time ago, I picked this book up to study the mathematics that underpins the various algorithms that we select and use. Despite such a long absence from studying mathematics, I found this book quite easy to understand and use.

The first chapter looks at counting from a practical, computing, perspective and introduces the use of sets as well as how they are applied to algorithms such as insertion sorts. The second chapter, on cryptography, can probably be omitted unless it is of specific interest. The third chapter considers logic and proofs, and is very well written. The fourth, fifth and sixth chapters deal with recursion, probability and graph theory respectively. All chapters are extremely practical as they have ample examples, using pseudo-code, that illustrate the use and analysis of various algorithms. This is done to understand the rationale, in mathematical terms, of the topic under discussion. Furthermore, every chapter ends with a set of exercises, some of which have answers or hints provided at the end of the book. All these tools give a refreshing balance between theory and practice that no other book (I have come across plenty!) on discrete mathematics comes close to in comparison. Indeed, any one chapter is worth the price of the book.

Thoroughly recommended. You will not regret buying this book as it will be a good reference even after you have studied it.

1 of 2 people found the following review helpful:

2.0 out of 5 stars Find a Different Book, November 1, 2011

By 

S.Tobin - See all my reviews

Amazon Verified Purchase

This review is from: Discrete Mathematics for Computer Scientists (Paperback)

The writing of this book is complete garbage. Every chapter is riddled with either non-sense proofs or complete mathematical jargon. They fail to put the concepts into writing understandable to someone who isn't a mathematician. On top of that the book is very quick paced. Constantly there are several page proofs/derivations that confuse you more than help you understand the simple equation shown shortly after. The book does offer helpful "check-up" exercises at the end of each section allowing you to check if you need to make another attempt at deciphering the previous section's jibberish. All in all, if you struggle with math vocabulary I suggest to choose another book. On the contrary if you excel at math and understand math terminology with ease this book might help you quickly learn discretionary mathematics.