Product Description
Computing Curricula 2001 (CC2001), a joint undertaking of the Institute for Electrical and Electronic Engineers/Computer Society (IEEE/CS) and the Association for Computing Machinery (ACM), identifies the essential material for an undergraduate degree in computer science.This Sixth Edition of Mathematical Structures for Computer Science covers all the topics in the CC2001 suggested curriculum for a one-semester intensive discrete structures course, and virtually everything suggested for a two-semester version of a discrete structures course. Gersting’s text binds together what otherwise appears to be a collection of disjointed topics by emphasizing the following themes: • Importance of logical thinking• Power of mathematical notation• Usefulness of abstractions

CUSTOMER REVIEWS (Average Customer Rating: 3.0 based on 15 reviews)

Mathematical Structures For Computer Science Review by W. Hollander

4 Stars
February 23, 2008
Mathematical Structures for Computer Science was a good buy. It was cheaper than the college book store and in good condition.

First one hundred pages were a waste by How much did I pay?? (Columbia MD)

1 Stars
February 13, 2008
I was forced to buy this book for class. The first 100 pages have been useless for me. I can't understand why my school is using it. From this point, I'll be reading a Discrete book my wife used 5+ years ago and I'll just work the required problems in this text.

A good reference by SDuermyer (Alden, NY USA)

5 Stars
July 25, 2005
I used this book in my Data Structures class. It has sample problems with solutions in the back of the book so you understand what they were talking about (unfortunately, I cannot say the same for a lot of data structures texts) The sample problems were also good for review for an exam. This was one of the few Computer Science textbooks that I have actually kept as a reference.

CS Professors Love This Book. CS Students Hate It. by C. Host

2 Stars
May 03, 2005
If you are seasoned in the ways of computer science and mathematics, you will probably love this book. However if you are new to the concepts presented in the pages of this book, you will probably hate it. It is particularly bad once you really start getting into the meat of things, around chapter three. The examples and explanations are utterly terse. Here is how the book defines "cardinality": "...The number of elements in a finite set is the cardinality of the set, so this would be a set of cardinality k." That is the best explanation the book offers as to the meaning of the word cardinality, a word my professor used close to fifty times every lecture, a word that really deserves better explanation than a single sentence, especially with regard to sets. If I were providing something constructive the author, I would probably say that definitions should be much easier to find and much more detailed and examples of definitions should cover all the angles. I suppose my largest complaint with the book would simply be that if you are a CS student and you REALLY NEED a strong foundation in the concepts of discrete math, this book doesn't quite get there. The book misses its target audience.

Not quite the best, but close by Charles Ashbacher (Marion, Iowa United States(cashbacher@yahoo.com))

4 Stars
February 19, 2005
Although there is now consensus over the coverage in a first course in discrete mathematics, the level of difficulty one finds in books for this audience has a wide range. Some opt for the basic approach, with very little rigor, and anything labeled as a proof is either trivial or an advanced waving of the hands. Notational complexity is kept to a minimum, which is fine for the beginner, but limits the value as the student goes on into more advanced courses. On the other end, there are those where rigorous proofs abound, it reads more like a book for traditional math majors rather than one largely designed for computer science majors. While Gersting is somewhere in the middle, the slant is more towards the advanced. The first four chapters cover logic, the fundamentals of proofs, set theory and relations and functions respectively. This order is in complete agreement with my beliefs. I would not give any book that does not start with these basic topics a second look much less consider adopting it. Graphs are covered in chapters five and six; Boolean algebra in seven and the theory of computation is covered in chapter eight. The treatment is on the high end, but still within the bounds of a first course in discrete mathematics. Worked examples are everywhere and a large number of exercises are at the end of each section. Practice problems are embedded inside the chapters and solutions to all the practice problems are found in an appendix. While I believe I have found a better book to use in my discrete class, this one is my second choice. In fact I successfully used it for two years, until I replaced it. The primary reasons for the change was that the new book has biographical sketches of mathematicians (something I adore), the font is larger and there are more solutions to the exercises.

SIMILAR PRODUCTS

	Computer Science: An Overview (10th Edition) by J. Glenn Brookshear (Author) Students and instructors alike continue to praise the broad coverage and clear exposition that Computer Science: An Overview uses to present a complete picture of the dynamic computer science field. Accessible to students from all backgrounds, Glenn Brookshear uses a language-independent context to encourage the development of a practical, realistic understanding of the field. The Tenth Edition employs several world-renowned experts in respective fields to ensure that coverage reflects...
	Java How to Program: Early Objects Version (8th Edition) by Harvey M. Deitel (Author), Paul J. Deitel (Author) "The [arrays] exercises are quite sophisticated and interesting. Provides the best combination of conceptual discussion and implementation examples of dynamic binding that I have encountered in a text. Excellent overview of basic networking via Java. Provides the perfect breadth and depth for generics in an entry-level Java class. Provides a good segue into a data structures course -- the exercises are excellent." -- Ric Heishman, George Mason University "Beautiful collections of exercises--a...
	Object-oriented Data Structures Using Java by Nell B. Dale (Author) Thoroughly revised and updated, Object Oriented Data Structures using Java, Second Edition presents classic data structure topics with an emphasis on problem solving, theory, and software engineering principles. Beginning early and continuing throughout the text, the authors carefully introduce and expand on the use of many Java features such as packages, interfaces, abstract classes, inheritance, and exceptions. Chapters have been rearranged to get to the heart of the textbook material more...
	Introduction to Java Programming, Comprehensive Version (7th Edition) by Y. Daniel Liang (Author) Groundbreaking fundamentals — first approach enables readers to understand the basics before being introduced to more challenging topics. Liang offers one of the broadest ranges of carefully chosen examples, reinforcing key concepts with objectives lists, introduction and chapter overviews, easy-to-follow examples, chapter summaries, review questions, programming exercises, and interactive self-test. Now uses standard classes only. Offers new chapters on data structures, JSF for visual Web...
	Data Structures: A Pseudocode Approach with C++ by Richard F. Gilberg (Author), Behrouz A. Forouzan (Author) This new book makes it simple for beginning computer science students to design algorithms first using pseudocode and then build them using the C++ programming language. Based on Gilberg and Forouzan's successful text, DATA STRUCTURES: A PSEUDOCODE APPROACH WITH C, this new book emphasizes the practical approach to data structures.