Discrete Mathematics And Its Applications Brief Edition Answers
See a Problem?
Thanks for telling us about the problem.
Friend Reviews
Reader Q&A
Community Reviews
Whenever I encounter math textbooks like this one, I'm reminded of Underpants Gnomes on South Park. For the unwashed: Underpants Gnomes stole underwear from the residents of South Park hoping that they'd profit from the thefts, but although their business plan included a Phase 1 ("Steal underwear") and a Phase 3 ("Make a profit"), Phase 2—the connective tissue—was just "?".
Rosen and others like him fail to grasp how much "?" connectiv
I'm convinced that math gurus are incapable of teaching math.Whenever I encounter math textbooks like this one, I'm reminded of Underpants Gnomes on South Park. For the unwashed: Underpants Gnomes stole underwear from the residents of South Park hoping that they'd profit from the thefts, but although their business plan included a Phase 1 ("Steal underwear") and a Phase 3 ("Make a profit"), Phase 2—the connective tissue—was just "?".
Rosen and others like him fail to grasp how much "?" connective tissue they're leaving out when they "teach" math. He'll describe a math concept using almost-but-not-quite human language, then—oh, there's always a "then" with these books—the math gymnastics begin. Math teachers can't resist the gymnastics, can they? No, they really can't. At some point they lose their ability to see how much they assume other people know, and when that happens they cease being effective at teaching. This describes almost every math teacher I've had, and it definitely describes almost every math textbook that I've read. Rosen's book isn't the worst math textbook that I've read, but it's still pretty awful.
Seriously, corner cases and extreme mind-bending problems don't help people learn math; giving students time to grasp concepts before baffling them with bullshit does. This is why math schools like Khan Academy are amazing and college/university level math courses are not. This stuff can be taught, but not like this.
...more
If you open the book without a lot of theoretical math background, you'll have a good time with this book. It's written for computer scientists, so doesn't go heavy on the proofs and exact arguments, definitions, theorems, results, etc., but it makes itself relevant with many examples of how conepts are applied in CS.
Math people will probably be frustrated at the lack of depth, verbose yet fuzzy explanations, and redundant examples. You'll probably want something more concise.
Liked:
- (Usu
tl;drIf you open the book without a lot of theoretical math background, you'll have a good time with this book. It's written for computer scientists, so doesn't go heavy on the proofs and exact arguments, definitions, theorems, results, etc., but it makes itself relevant with many examples of how conepts are applied in CS.
Math people will probably be frustrated at the lack of depth, verbose yet fuzzy explanations, and redundant examples. You'll probably want something more concise.
Liked:
- (Usually) very accessible for people who aren't used to pure math (proofs, axioms, abstractness).
- Many illustrative, real-world examples
- Decent breadth of topics
Disliked:
- Skimpy proofs, interesting results are usually tucked away amongst the dozens of computational exercises. It's hard to figure out which problems are even worth doing.
- Too many examples. There are chapters where the vast majority of the text is just examples of the concept in action; in the graph theory chapter, there was a section with like 13 examples of basically the same thing.
- Shallow treatment of the math, sloppy definitions (he defines "clique" with the definition of the maximal clique), doesn't cover a lot of cool material that's appropriate to the subject.
- Slightly disorganized: the order in which graph theory concepts are described is awkward; you end up having to flip to the previous section, go through 12 examples to find a definition or theorem, and then flip back to the current page in order to remember what's going on.
- Doesn't acknowledge when facts are implicitly used despite not having been introduced yet.
- Not very good at explaining a lot of things, especially since his narration is inconsistent.
I think I will keep learning from the book and I would say all in all it's a good textbook. I really want to know more about discrete probability sooner rather than later.
I used this text for my discrete math course. We covered six chapters and it was quite thorough. my major complaint with it is that Rosen can be portentous sometimes with his examples. He knows he knows this subject well and he wants to impress you all the time.I think I will keep learning from the book and I would say all in all it's a good textbook. I really want to know more about discrete probability sooner rather than later.
...more
Quite frankly, differently from what I heard from several other reviews, I never had particular issues at either reading or following this book, except for the not uncommon overtime sometimes needed for finishing some of the exercises.
It was a fascinating read half of the chapters and performed many of the exercises. I found myself more confident in my reasoning skills and also a more rounded citizen of the worl
Discrete Mathematics is a field of study integral to the Computer Sciences. It lays the foundations for mathematical thinking in its coverage of proofs, it dives into relevant aspects of application ranging from recursive algorithm structure to modelling networks and efficient systems architecture for modern computing.It was a fascinating read half of the chapters and performed many of the exercises. I found myself more confident in my reasoning skills and also a more rounded citizen of the world.
Great book!
...more 
For example, null quantification is a concept introduced WITHIN the problem set for chapter 1.4. Wouldn't it make more sense to introduce the notion of null quantification (and how to go about solving it) in the subch
As a non-mathematician, I am a bit overwhelmed by the difficulty of the problem sets towards the end of each set (usually around #45-60). I have found that some of the practice problems require knowledge that is either accessed in later subchapters or requires outside help to solve.For example, null quantification is a concept introduced WITHIN the problem set for chapter 1.4. Wouldn't it make more sense to introduce the notion of null quantification (and how to go about solving it) in the subchapter?
Regardless of my nit-picking, I plan on finishing the text as it is, from what I understand, the best introduction on the topic of discrete math for computer scientists.
...more This book, and Susanna Epp's discrete mathematics with applications, are among the worst math textbooks I have ever seen.
* Poorly written and poorly organized
* Too wordy
* Essential points are in a single sentence hidden in the middle of paragraphs of page-long examples.
* You can't find a previously read topic in too much overly wordy description. Googling is much faster.
It's ridiculous that many classes use this book. It seems a strong connection occurred between teachers a
Review of 8th Edition:This book, and Susanna Epp's discrete mathematics with applications, are among the worst math textbooks I have ever seen.
* Poorly written and poorly organized
* Too wordy
* Essential points are in a single sentence hidden in the middle of paragraphs of page-long examples.
* You can't find a previously read topic in too much overly wordy description. Googling is much faster.
It's ridiculous that many classes use this book. It seems a strong connection occurred between teachers and publishers.
...more
Math is not my skillset, but I used this textbook for Discrete Math I at College of Charleston back in the early 2000's. I did pass the course. While I did not understand every concept, the book was adequate enough for the course. Not My Best Subject But..
Math is not my skillset, but I used this textbook for Discrete Math I at College of Charleston back in the early 2000's. I did pass the course. While I did not understand every concept, the book was adequate enough for the course. ...more
btw you can introduce yourself with Σ, ∀, ∃ and others interesting possibilities
Very clear ideas and nice methods for solutions
| topics | posts | views | last activity | |
|---|---|---|---|---|
| logics | 1 | 21 | Mar 28, 2010 10:50AM |
Goodreads is hiring!
Learn more »
(1972), and his Ph.D. in Mathematics from M.LT. (1976).
Dr. Rosen has published numerous articles in professional journals in the areas of number theory and mathematical modeling. He is the author of the textbooks Elementary Number Theory and Its Applications, published by Addison-Wesley and currently in its fifth
Dr. Rosen received his B.S. in Mathematics from the University of Michigan, Ann Arbor(1972), and his Ph.D. in Mathematics from M.LT. (1976).
Dr. Rosen has published numerous articles in professional journals in the areas of number theory and mathematical modeling. He is the author of the textbooks Elementary Number Theory and Its Applications, published by Addison-Wesley and currently in its fifth edition, and Discrete Mathematics and Its Applications
...moreNews & Interviews
Welcome back. Just a moment while we sign you in to your Goodreads account.
Discrete Mathematics And Its Applications Brief Edition Answers
Source: https://www.goodreads.com/book/show/1800803.Discrete_Mathematics_and_Its_Applications
Posted by: aquinowassent.blogspot.com
0 Response to "Discrete Mathematics And Its Applications Brief Edition Answers"
Post a Comment