Keep in mind that Discrete Math

Thomas Owens @$begingroup$ It was actually an attempt to make the same program that was already in existence in Stanford to make it easier for people who want access. It makes you want to get the exercise done! $\endgroup$ The preface to this second version. $\endgroup$ The book needs an understanding of discrete math that is way beyond what a programmers needs to be aware of. $\begingroup$ That’s true.1 Actually, I think this book is designed for computer scientists who are at the upper grades of an undergraduate degree or those who are the beginning of a graduate degree. $\endgroup$ However, I stand by my belief that you will not master discrete mathematics with this book, as the prerequisite for this book is a foundation in the fundamental concepts of discrete mathematics. "$begingroup$ @Thomas O’Norris The truth is that it was an attempt to make an existing program similar to the one you described which was in place within Stanford in order to increase its accessibility.1 The book addresses the question in the title, but doesn’t take into consideration the main question , where the reader seeks a reference book to help them acquire the fundamental knowledge of discrete mathematics which could be needed to gain an understanding of algorithms The $endgroupendgroup This is the reason for the preface in The second edition. $\endgroup$ $begingroup$ In the preface of the book clearly states that it is not a substitute for a separate math textbook. $\begingroup$ That’s true.1 This is an untrue solution to the question. $\endgroup$ However, I am still adamant in my claim that you can not be taught discrete mathematics by this book because one of the requirements for this book is an understanding in the basics of discrete mathematics. Distinction Math skills are required to be able to prove the accuracy and complex nature of data structures and algorithms.1

The book is able to answer the question that is in the title, however it does not consider the rest of the query where the person is seeking a resource that will help him develop the fundamental understanding of discrete math that could be required for more understanding of algorithms."$endgroupthe endgroup The concepts will be taught in books on Algo/DS, but you will only gain math skills by practicing only discrete math.1 The introduction to this book explicitly states it’s not a stand-in for a textbook in discrete math. Knuth book is excellent for this. It’s a bad response to that question. $\endgroup$ However, IMHO it is only necessary if you require it for performing advanced proofs in the field of DS/Algorithms.1 Distinction Math understanding is required to master the validity and complex nature of data structures and algorithms.

For a beginner, it would be great to go over "Grimaldi" http://www.amazon.com/Discrete-Combinatorial-Mathematics-Applied-Introduction/dp/0201199122 and then quickly move to Algorithms.1 They will teach these in the Algo/DS textbooks, however, you can only attain math proficiency through practicing discrete math. If you don’t, you’ll keep exploring the depths of Discrete Math and never get to Algorithms/DS. Knuth book is great to use for that. Keep in mind that Discrete Math does not teach you how to create algorithmic structures or data.1 But, IMHO that you’ll only require it when conducting advanced proofs using Algorithms/DS. This can only be learned by doing Algorithm problems using topcoder, ACM icpc, spoj, etc. and by reading books about Algorithms/DS, or courses on them.

For a beginner, it would be great to go over "Grimaldi" http://www.amazon.com/Discrete-Combinatorial-Mathematics-Applied-Introduction/dp/0201199122 and then quickly move to Algorithms.1 A great textbook on discrete mathematics for undergraduates can be found in that of the Kenneth Rosen book titled Discrete Mathematics and its Applications. If not, you’ll continue learning more about Discrete Math and never get to Algorithms/DS.

The book offers solutions to half the issues. Be aware that Discrete Math does not teach students how to design methods or structures for data.1 It is also possible to purchase the Student’s Solution Guide. It is only through working on Algorithm problems with topcoder ACM icpc, spoj and reading books about Algos/DS or courses about them.

I don’t have it, but I’d think it could provide solutions to the second half of the questions , or offers a step-by-step method of solving the issues (the book provides only the only the answers to the questions, with no explanations of the answers).1 A good textbook for learning discrete mathematics at the undergraduate level includes The Kenneth Rosen book titled Discrete Mathematics and its Applications. It’s used in the two-quarter course of Discrete Mathematics that is taken by computer science and software engineering majors, as in a variety of math courses at my university.1 The book contains solutions to a majority of the problems. I had this book in my library even after I completed the course, and am currently studying it to refresh my math skills in discrete form to prepare for the Certified Software Development Associate exam. You can also purchase the Student’s Solution Guide.1

Beginning Group $ Looking through the Rosen book that you linked to, many of the reviewers are complaining that it’s a paperback edition and that the paperback version is in fact a totally different text from the hardback that is used in the majority of courses. I don’t have it, however I would believe that it contains an answer to remaining portion of the questions or gives a step-by step guide to solving the problem (the book is only providing the an answer to the question with no explanation of the answers).1 Did you intend to endorse either the hardback or the paperback? $\endgroup$ It’s used to teach the two-quarter series that is part of Discrete Mathematics that is taken by computer science and software engineering majors as well being used in various mathematics courses offered at my school.

Lascia un commento

Il tuo indirizzo email non sarà pubblicato. I campi obbligatori sono contrassegnati *