Discrete Mathematics for Computer Scientists
| Author | : | |
| Rating | : | 4.40 (607 Votes) |
| Asin | : | 0132122715 |
| Format Type | : | paperback |
| Number of Pages | : | 528 Pages |
| Publish Date | : | 2014-01-10 |
| Language | : | English |
DESCRIPTION:
From the Back CoverDiscrete Mathematics for Computer Scientists provides computer science students the foundation they need in discrete mathematics. Lighten your backpack. Purchase your assigned textbook as a CourseSmart eTextbook, and stop lugging books around campus! You can also access CourseSmart eTextbooks from your iPhone. 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 environmentsIntended for students who have completed, or are simultaneously studying, data structures (CS2)Written by leading academics in the field of computer s
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. His work has been supported by the National Science Foundation and Sloan Foundation. He is a winner of the Dartmouth Distinguished
Stein/Drysdale/Bogart's Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course.Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using motivating, relevant CS applications. This text takes an active-learning approach where activities are presented as exercises and the material is then fleshed out through explanations and extensions of the exercises.
"Great treatment of essential Discrete Mathematics for Computer Science." according to JacobeanEra. I am very surprised by the average review score for this book - perhaps it has to do with the active learning aspect of the book, and having to think upfront about the examples - to get the most out of the book. Personally, I thought it was an extremely well written book, all topics covered where fundamental for advanced computer science classes - the treatment of discrete probability and recurrence relations where the highligh. "Needs substantial revision" according to William Kerney. I used this book in my Discrete Mathematics class this semester. I picked it mainly because the chapters lined up with what I wanted to teach in the class: an early emphasis on modular arithmetic and RSA encryption, followed by logic, recurrences, probability, and graph theory, which was perfect.As it turns out, though, the book is very lacking. When we got to the section on proof by induction, I wanted to issue some homework p. "Find a Different Book" according to S.Tobin. 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 of