Discrete Math Textbook Recommendations?
JonnyRo88 asks: "I am an undergraduate CS major at the University of Central Florida. I took a Discrete Math course this past semester and had a VERY difficult time with the text book the class used: 'Discrete and Combinatorial Mathematics' by R. Grimaldi. I do not attribute my difficulties to the book itself, rather I just feel that my learning style is incompatible with the way this book is laid out. I'm sure that others have had similar experiences where they could just not -click- with a book. Like many people I know I tend to learn almost all of the class material from the book. I learn really well from books that focus heavily on examples and explanations on how those examples work. I would love to hear what Slashdot readers consider their most useful Discrete Math textbook. Most interesting are books that have very good discussions on the basic strategies of proofs. I am currently preparing to take an exam that the department requires all CS majors take before they can move to higher level classes, it will test me on my knowledge of discrete math, specifically proofs (by induction, disproof by contradiction, direct proof, recursive definitions, etc)."
I'm worried about a similar topic.
I am an undergraduate CS major at the University of Central Florida. I took a Discrete Math course this past semester and had a VERY difficult time with the text book the class used: 'Discrete and Combinatorial Mathematics' by R. Grimaldi. I do not attribute my difficulties to the book itself, rather I just feel that my learning style is incompatible with the way this book is laid out. I'm sure that others have had similar experiences where they could just not -click- with a book. Like many people I know I tend to learn almost all of the class material from the book. I learn really well from books that focus heavily on examples and explanations on how those examples work. I would love to hear what Slashdot readers consider their most useful Discrete Math textbook. Most interesting are books that have very good discussions on the basic strategies of proofs. I am currently preparing to take an exam that the department requires all CS majors take before they can move to higher level classes, it will test me on my knowledge of discrete math, specifically proofs (by induction, disproof by contradiction, direct proof, recursive definitions, etc)
Maybe this can help me,too. I think the problem is just a simple lack of reading compression on my part. Perhaps some sort of remedial studies could help us both? Thanks for the great Ask Slashdot!
Consensual sex is boring.