Discrete Mathematics for Computer Scientists (英語) ペーパーバック – 2010/3/3
Kindle 端末は必要ありません。無料 Kindle アプリのいずれかをダウンロードすると、スマートフォン、タブレットPCで Kindle 本をお読みいただけます。
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.
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.
It is pretentious, uses overblown language and jargon instead of clear, precise writing. It is "academic" writing at its worst. However, that's not even the worst thing about this book. For some reason that the authors decided was "innovative" or "cute" - they start by throwing examples at you, after which they throw more jargon and "explanation" that is not close to explanatory because of the language they use. Even the structure of the book does nothing to help explain it - there is no cohesion. I am using YouTube, other books (including Rosen's excellent Discrete Mathematics and Its Applications, Concrete Mathematics, the MIT OCW course in Mathematics for Computer Science, and a variety of other materials to try and make it through this course.)
Unfortunately, my institution chose this book - why they chose it is as incomprehensible as the book.
Just run if you see your instructor wants to use this book. If I could give it a negative rating --- I would.
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.