<p>What does everyone here think is harder. I want to go into computers so I figured I would get a head start on discrete. I think that is is a lot harder than calc, and requires much more thinking, and I have only done a little bit of it. The book is discrete math and its applications and some of the problems at the end are killer. Topics include demorgans laws, algorithms, big O, graphs (computer programming kinds) and set theory. Just looking for opinions.</p>
<p>discrete is probably much harder than BC</p>
<p>Discrete is definitely harder.</p>
<p>the book discrete mathematics and its applications is really good. A lot of people on amazon ranked it low, but to me it gives a great understanding of the into to discrete math, and into some advanced topics. Its good if you are taking CS or even calc, because it goes through all the algorithms and gives a great info on big O notation. It also will help you programming in general by giving you applied knowledge. It is going into sequences, which my calc will not cover. This way, when I look at the PR book for calc, sequences will be easier.</p>