Resources/Books for Discrete Mathematics I am going to a Computer Science Course in University next year. I heard that Discrete Mathematics is whats required for Comp Sci so, I am looking for resources/books that I can read to get started with. I picked up Schaum's Outline of Discrete Mathematics. I find that some things are alittle hard to understand still. I have also looked at some videos from Khan Academy on YouTube, I find the videos easy to understand. Except that I don't really know where am I supposed to start 1st. I am on algebra now, but can someone tell me whats the sequence I should go from here, eg. topics/playlists?
An you know, for maths, there must be alot of practice. So where can I find lots of practice questions? Schaum's Outline of Discrete Mathematics has quite little practice questions. 
 A: I think Kenneth Rosen's book on Discrete Mathematics does a good job of being exhaustive. Although I have heard mixed reviews of the book from others, I myself, began studying discrete mathematics from this book and was very happy with it. 
A: It may be worth having a look at the following blog for a selection of resources for introductory discrete mathematics resources, a lot of them free.
If you are looking to buy a book, Discrete Mathematics with Applications by Susanna S. Epp is particularly good. Plenty of exercises and examples.
I really dislike Rosen's book. I don't find his examples instructive at all.
A: Mathematics - A Discrete Introduction  by Edward R. Scheinerman is the best book for learning discrete math that I have come across. 
Kenneth Rosen's book blows; sorry, but it's true - I had to suffer through it back in college. It wasn't fun. 
Scheinerman's book made discrete math interesting again. I think it was the uncluttered presentation and clear explanations.
A: If you are going to study computer science, you want to read Graham, Knuth, Patashnik: Concrete Mathematics.
Look into solving recursion, combinatorics and maybe a little stochastics. Getting the hang of infinite sequences and series is also advisable. Above stated book covers that all because it is made for computer scientists. You should have math courses covering all that, though.
A: There are a lot of really nice resources out there, depending on what you are more interested in. In fact, it's easy to get overwhelmed by the sheer number, so I'll restrain myself to recommending a few favorites.
My first (and favorite) choice for this is Introduction to Mathematical Structures by Steven Galovich. The book begins with a chapter on logic, axiomatic methods, and proof methods, which I think does one of the best jobs at motivating not just the traditional methods of expressing these mathematical ideas, but methods of thinking about these ideas. Galovich then continues with the classic topics of set theory, relations, cardinality, combinatorics, graph theory, and algebraic structures. This is a relatively short book, which doesn't give as wide or thorough coverage to everything one might term "discrete math" as Rosen's text mentioned above (and it's not generally mentioned in situations like this do to its sections on more infinite matters), but I think is truly one of the best starting points do to its wonderful explanations of interesting mathematical ideas and emphasis on getting people to think mathematically. For instance, to give you an idea of what I mean by this, here is a statement from the introduction of a suggestion for readers:

In general, read this book with a
  sharp pencil in hand, plenty of paper
  nearby, and several questions in mind.
  A list of questions might include the
  following:
  
  
*
  
*What is the essence of this theorem, example, or definition?
  
*Can I come up with an outline of a proof of the theorem?
  
*Do I understand all the steps in the proof?
  
*What is the main idea of the argument?
  
*Can I draw a picture illustrating the situation?
  
*Am I stuck? If so, where am I stuck? Can I review some material to
  help me get unstuck? Are there
  examples that I can consider to help
  me understand the given situation?
  

There is also a newer book by Galovich which I have heard is both very good and very similar, called Doing Mathematics: An Introduction to Proofs and Problem-Solving which may be easier to find in person, if you are not a fan of ordering books online (although it's hard to imagine a much better deal than the $15 I linked to for Galovich's Structures).
The above is one of the best resources for learning to think mathematically (which, for my money, is usually the thing most desired in situations such as this), but if you want more exposure to particular areas of discrete math, or even a good overview of all the topics which might come under the heading "discrete math" then it won't cut it alone.
Rosen's book (mentioned above, Discrete Mathematics and Its Applications) is, I would say, the most thorough of all possible options, covering almost any topic that one might ever consider calling "discrete math," and doing so reasonably thoroughly. I think that, as such, Rosen makes a very good reference book, but I would not recommend it as a starting place for self study as I think that Rosen does a very poor job of motivating ideas and explaining difficult concepts. 
As such, if you want a friendlier introduction to a lot of the different ideas of discrete math, I would recommend Discrete Mathematics by Lovasz. This book does an exceptional job of giving an introduction to many areas of discrete math, with good motivation for why you would be interested in these questions in the first place, and very friendly discussion of ideas. The downside of this book that I see is that sometimes it feels as if it carries the "friendliness" a bit too far, to a point where one feels a lack of rigor, but if you read this accompanied by another book such as Galovich's emphasizing the importance of good mathematical arguments, I think you should be in good shape.
Hope this helps, and good luck with your studies!
PS: Finally, after all of this typing, I'm going to provide a link to one of my favorite humorous articles: "The Uses of Fallacy," which I was provided by my professor when I first embarked on a course using mathematical logic, which I think is a fun look at the ideas of another field we've been working in for a long time without realizing it: generalized logic. "In Classical Logic, a Theorem consists of a True Statement for which there exists a Classical Proof. In Generalized Logic, we relax both of these restrictions: a Generalized Theorem consists of a Statement for which there exists a Generalized Proof."
A: I will say a good and extense explorer is http://metamath.org which in his start Metamath Proof Explorer Home Page also has a suggested reading in FAQ as a reference to A Primer for Logic and Proof by Holly P. Hirst and Jeffry L. Hirst.
A: You may be interested in this sequence of online discrete math courses: Discrete Math for Beginners: Open Doors to Great Careers
The first course goes through logic and proofs.  The second course continues to set theory, functions, relations, and algorithms.
