# Reddit reviews Discrete Mathematics and Its Applications Seventh Edition

We found 22 Reddit comments about Discrete Mathematics and Its Applications Seventh Edition. Here are the top ones, ranked by their Reddit score.

McGraw-Hill Science Engineering Math

A lot of it is probably confirmation bias, but yes, it does happen.

HP used to have expiry dates on their cartridges claiming they degraded printing after a certain time: http://www.hp.com/pageyield/articles/uk/en/InkExpiration.html

Another example from the software development world: Red Gate announced that one of their products (Reflector) would no longer be free starting from the next version

and disabled all existing free copies, a move that upset many developers: http://www.infoq.com/news/2011/02/NET-Reflector-Not-FreeCollege textbooks are the most literal example of planned

obsolescence; the new editions often contain very few new material and cost a lot while all older versions can be bought for almost nothing... and of course most classes require the new version.For instance, Kenneth Rosen's "Discrete Mathematics and its Applications" currently sells for $125 if you want the [latest edition] (http://www.amazon.com/Discrete-Mathematics-Applications-Kenneth-Rosen/dp/0073383090/), $100 for the one before that and $16 for an older one even though the number of pages only increased by 100 each time. Thankfully, my teacher gave us the page numbers for both the latest and the second-latest editions...

The textbook is usually Discrete Mathematics and It's Applications. Don't let the bookstore fool you, the sell the "UCF Edition" for an inflated price. The only difference is an additional introduction. Here is an Amazon link where you should be able to find a reasonably priced used copy. Alternatively, here is a link to a PDF copy that you can have for free! Enjoy =)

You won't get a hang of anything until and unless you practice. Since you are having Object Oriented Programming, go on and make a project. This will give you a sense of accomplishment and on the way you will learn a lot of things.

Talking about data structures, you will need the concepts of this course everywhere. I would suggest you to strengthen your basics by refering to CLRS or some other resource, that is totally your choice. But, implement the data structure you have learned. There are a lot of resources out there, I am listing some of my favorites:

>https://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

>https://www.coursera.org/specializations/algorithms

I would also suggest you to read discrete mathematics. The book that I use is

>https://www.amazon.com/Discrete-Mathematics-Applications-Seventh-Higher/dp/0073383090/ref=sr_1_1?ie=UTF8&amp;qid=1492831532&amp;sr=8-1&amp;keywords=discrete+mathematics+kenneth+rosen

You can also go through the discrete mathematics course from MIT OCW.

In case you need some help, PM me. I'll be more than happy to help :)

First, what Computer Science is

not: Programming. Programming is an application of what we have learned from Computer Science, but it isn't CS. Programming is the work crew putting up a building, and Computer Science is the architectural engineer who designed it, and proved that it was possible to build it.Computer Science is a branch of Mathematics and Philosophy. It asks the question: given this definition of what counts as a computer, what are the limits in terms of what can be computed? What

canbe computed, and what can't? What is the lower and upper bounds of how fast something can be computed?These are questions that probe the boundaries of our universe. It's beautiful, it's stunning, it's exciting, and yes, tiny breakthroughs are often applicable in ways that are worth quite a bit of money.

If you're just looking for something 'not too complex', you should go study something else. You won't like this. In fact, if your primary goal is to find something easy, you should reconsider post-secondary education for a couple years, until you've found something that you actually want to learn the complexities of. University is hard, and it's meant to be hard.

Lastly, if you really do want to see what you'll get first year that will make you angry, go find a copy of Discrete Mathematics And Its Applications. At my University, that text was for a first year course, and those who were looking for an easy degree tended to fail out at that point.

CS182 is a discrete mathematics course. It has a lot to do with logic and proofs, and less to do with algebra and calculus. Most have never really seen what you will be covering. If you can, I would get the book and work through some of the problems before the start of the semester.

CS240 is similar to CS180, but it is taught in C — a much lower-level language. Once again, I recommend getting the book (I assume it will be The C Programming Language) and doing some of the exercises. Java syntax comes from C/C++, so that part will be somewhat familiar. C is pretty barebones, though. There are no classes, only functions. There is no

`ArrayList`

,`LinkedList`

, etc. You have to build it all yourself. And when you allocate memory using`malloc()`

(similar to calling`new`

), you have to remember to free it when you’re done using`free()`

. There is no garage collection.Good luck!

I took a Discrete Mathematics class in College, and this was the textbook the professor recommended:

http://www.amazon.com/Discrete-Mathematics-Applications-Kenneth-Rosen/dp/0073383090/ref=la_B001IGOE0C_1_1/189-4818032-4394023?s=books&amp;ie=UTF8&amp;qid=1382239523&amp;sr=1-1

I can't honestly say I ever touched it, because the class was actually very easy, and you could study for it using only the professor's lecture notes.

MIT's OCW also has some material available (it includes video lectures, assignments and a textbook):

http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010

I have not taken the class yet (I'm taking 161 and 225 in January), but I looked at the syllabi already and here's the textbook for the class:

http://www.amazon.com/Discrete-Mathematics-Applications-Kenneth-Rosen/dp/0073383090/ref=sr_1_1?ie=UTF8&amp;qid=1417826968&amp;sr=8-1&amp;keywords=Rosen+Discrete+Math

You may want to go ahead and pick this up and start looking through it prior to January. I already grabbed a copy; I finish Calculus II tomorrow at my community college and I am going to be starting Rosen very soon.

This book is also commonly recommended:

http://www.amazon.com/Discrete-Mathematics-Applications-Susanna-Epp/dp/0495391328/ref=sr_1_1?ie=UTF8&amp;qid=1417827137&amp;sr=8-1&amp;keywords=Epp

I'm not sure what your math background is, but one of the most important success factors (in my experience) in math classes is a lot of practice. If you start working through either of those books now, you'll probably be in a good place once class starts in January.

We could also probably get a study group going on in here; I'm pretty comfortable with math, so I am happy to help out anyone else who needs help.

I feel like their recommend books covering discrete mathematics is a bit lacking. A book that I would recommend for it is Discrete Mathematics and Its Applications

Could be. I took discrete math last semester, and we spent a few weeks on cryptography. We used this book.

Mulțumesc mult pentru recomandări și pentru răspunsul elaborat!

Împreună cu cartea linkuită de tine am mai luat și Discrete Mathematics and Its Applications, Kenneth H Rosen.

since you are a computer science student, you can start with proofs in Discrete Mathematics fo this you can look at Kenneth Rosen's book, it can help you with a lot of basic concepts, constructing proofs. Its a good book for those who want to go in algorithms or theoretical cs or a even want to work on pure maths problems. I had this same confusion I wanted to do maths but also cs with it. After this you can try "The art of computer programming"(this has 4 volumes) by Donald Knuth but CLRS is a must along with Rosen's if you want to take cs and maths side by side. If you want to explore further you can look at Design of Approximation Algorithms and Randomised Algorithms. These book can help you with concepts of probability, number theory, geometry, linear algebra etc. But then if you want pure math problems then search for them, go though different journals, SIAM and Combinatorica are really good ones, search them pick a problem you like, then find text relevant to problem and try to give better solutions.

I should note that topics like graph theory, combinatorics, areas otherwise under the "discrete math" category, don't really require calculus, analysis, and other "continuous math" subjects to learn them. Instead, you can get up to college level algebra, then get a book like

Discrete Mathematics and Its Applications Seventh Edition (Higher Math) https://www.amazon.com/dp/0073383090/ref=cm_sw_r_cp_api_U6Zdzb793HMA7

Or the more highly regarded but less problem set answers,

Discrete Mathematics with Applications https://www.amazon.com/dp/0495391328/ref=cm_sw_r_cp_api_d7ZdzbQ77B65P

This will be enough to tackle ideas from discrete math. I'd recommend reading a book on logic to help with proof techniques and the general idea for rigorously proving statements.

Gensler is a great one but can require a computer if you want more extensive feedback and problem sets.

Sipser's

Introduction to the Theory of Computationis the standard textbook. The book is fairly small and quite well written, though it can be pretty dense at times. (Sipser is Dean of Science at MIT.)You may need an introduction to discrete math before you get started. In my udergrad, I used Rosen's

Discrete Mathematics and Its Applications. That book is very comprehensive, but that also means it's quite big.Rosen is a great reference, while Sipser is more focused.

I've only browsed Concrete Mathematics, but others have said it might not be sufficient. My uni used Rosen's Discrete Mathematics and its Applications. I think it's a fairly standard text. Pricey, but older editions might be just as useful.

I found this book quite understandable

Logic, Number theory, Graph Theory and Algebra are all too much for you to handle on your own without first learning the basics. In fact, most of those books will probably expect you to have some mathematical maturity (that is, reading and writing proofs).

I don't know how theoretical your CS program is going to be, but I would recommend working on your discrete math, basic set theory and logic.

This book will teach you how to write proofs, basic logic and set theory that you will need: http://www.amazon.com/How-Prove-It-Structured-Approach/dp/0521675995

I can't really recommend a good Discrete Math textbook as most of them are "meh", and "How to Prove It" does contain a lot of the material usually taught in a Discrete Math course. The extra topics you will find in discrete maths books is: basic probability, some graph theory, some number theory and combinatorics, and in some books even some basic algebra and algorithm analysis. If I were you I would focus mostly on the combinatorics and probability.

Anyway, here's a list of discrete math books. Pick the one you like the most judging from the reviews:

Don't bother trying to learn too much too soon, as you really do need to let time for the math to sink in.

Looks like a good workbook, but fails as an instructional book according to the reviews. Still a good share!

I took a long, long break between undergrad and grad school (think decades). I found this GRE math prep book very helpful. (The GRE math section tests high school math knowledge), I'd take the sample tests, see where I fell short, and focus on understanding why. I also found Practical Algebra to be a good review-and-practice guide, for the fundamentals. I boned up on discrete math by buying an old copy of Rosen and the matching solutions guide. And, I watched a bunch of videos of this guy explaining various facets of the math you need for computer science.

I once took a first-year course in logic, starting with the propositional calculus. All these years later, I still regard it as the most important thing I ever did. Proof-writing became [almost] easy after that. It wasn't always easy to put the pieces together, but at least I had a blueprint. I knew that if I could clearly define a contrapositive, or understand how set identities like DeMorgan's Laws were constructed, I was on much firmer ground. I highly recommend Discrete Mathematics and Its Applications. It's such an enormous and comprehensive text, in so many subjects, that I found myself referring back to it, for something, in almost every class of my undergraduate.

This was recommended by my very adept discrete math prof (don't worry, he's not the author). The excerpts I've used are good. The reviews make it seem pretty hit or miss, but textbooks tend to be that way on amazon.

I've found Discrete Mathematics and Its Applications to be easily the most useful textbook I've owned throughout my CS degree. I highly recommend it.

We got told to buy this one, but after looking at the reviews and the price - I think i'll give it a miss...

>54 of 61 people found the following review helpful

>1.0 out of 5 stars Just awful. November 16, 2011

>53 of 61 people found the following review helpful

>1.0 out of 5 stars Irresponsible Publishing! September 7, 2011

>17 of 19 people found the following review helpful

>1.0 out of 5 stars Worst math textbook. Ever. February 11, 2012