We found 10 Reddit comments about Discrete Mathematics and Its Applications. Here are the top ones, ranked by their Reddit score.
Discrete Math and Its Applicaitons by Kenneth Rosen.
Pretty much the goto book.
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-Free
College 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...
Actually there are more players in non-season than in season. 75%-25% split in softcore.
>neither did I until I went on Seasons.
You're basically saying you didn't give a shit about non-seasons. Then you joined seasons, and you started giving a shit about non seasons.
A little resource you might find helpful.
For CS, discrete maths are generally more useful than continuous maths.
Look into set theory, graph theory, and logic, in particular. At my school, we used Rosen, but there are probably better introductions.
HW 1&2 are probably logic, proof methods and induction. These are very basic stuff that should always be the same. Course might have changed in advanced material. For example, when I took CS70, we saw Graph Theory, Countability, some Computability and a little Measure; but these are not necessarily thought every semester. Also, probability part (as far as I understand) change pretty profoundly (it is the very last part of the course).
When I took CS70 I went over this textbook: https://www.amazon.com/Discrete-Mathematics-Applications-Kenneth-Rosen/dp/0072899050 but I must say the course was significantly harder than this textbook; and homeworks and class notes were much more beneficial than this book.
I'd recommend doing mathematics, It's much important than learning a language. It helps you grab the logic of solving a problem.
Discrete Mathematics by Rosen is the best book from my experience.
Graph Theory by Bollobas is recommended by many but i prefer Graph Theory by Douglas West
Algorithms by Cormen. No introductions needed this book encompasses most of the problems you'll encounter.
However if you're keen on learning a C/C++/Java i'd recommend the Head First Series from O'Reily .
Yes there are?
I believe those were the books used during the 2016-2017 school year (thats when I took discrete II)
From what I understand now, the newest renditions of the course use
Discrete Mathematics and Its Applications by K. Rosen
A First Course in Probability by Ross
But it'll depend entirely on who it is that's offering the course during the summer and what they include on their syllabus so I'd wait until seeing what they say to purchase either of the books.
The first book you listed (Mathematics for Computer science) is available for free for anyone to use here
The second is available for free on the Rutgers libraries website so I'd advise you not waste your money buying either of those two.
Hope this helps
I've used Rosen's Discrete Math text for a few courses. It also features a lot of applications to CS.
Mathwise you could start with some basic number theory
I found Rosen's Discrete Mathematics textbook to be really helpful.
You could also start with boolean algebra (AND OR NOT XOR ) bit shifting and so on since it will be absolutely useful later on.
For computer hadware and assembly language, I used this book Art of Assembly Language by Randall Hyde and Computer Organization and Design by Patterson and Hennessy.
For cryptography you might learn all about prime numbers , algorithms to find really large prime numbers, random number generator algorithms and why some are more random (cryptographically strong) than others.
Then using that you can apply that towards public / private key encryption, one way hash functions, and the main hash algorithms used by the public.
(MD5, RSA, SHA512) and how they compare against each other.
And how one way hash function are used to verify data integrity.
I found Gary Kessler's site to be really helpful
For password security then you can understand how you can use a one way hash function with a salt and a nonce to make a reasonably secure password storage system. You could learn how one could safely store password hashes in a database like mySQL (www.mysql.com)
And once you understand one way hash functions and public and private keys, then you would already 90% on the way to understand how the bitcoin protocol works and how CPU's mine bitcoins and how the public ledger blockchains works.
For other languages, another language you could easily learn is Java using Processing. I really do enjoy using it and it was easy and fun to learn, and I use it a lot for rapid prototyping.