Book Description
The Encyclopedia of Computer Science is the definitive reference in computer science and technology. First published in 1976, it is still the only single volume to cover every major aspect of the field. Now in its Fourth Edition, this influential work provides an historical timeline highlighting the key breakthroughs in computer science and technology, as well as clear and concise explanations of the latest technology and its practical applications. Its unique blend of historical perspective, current knowledge and predicted future trends has earned it its richly deserved reputation as an unrivalled reference classic.

What sets the Encyclopedia apart from other reference sources is the comprehensiveness of each of its entries. Encompassing far more than mere definitions, each article elaborates on a topic giving a remarkable breadth and depth of coverage. The visual impact of the volume is enhanced with a 16 page colour insert spotlighting advanced computer applications and computer-generated graphics technology. In addition, the text is enlivened with figures, tables, diagrams, illustrations and photographs.
 
With contributions from over 300 international experts, the 4th Edition contains over 100 completely new articles ranging from artificial life to computer ethics, data mining to Java, mobile computing to quantum computing and software safety to the World Wide Web. In addition, each of the more than 600 articles have been extensively revised, expanded and updated to reflect the latest developments in computer science and technology.

Intelligently and thoughtfully organised, all the articles are classified around 9 main themes

• Hardware
• Software
• Computer Systems
• Information and Data
• Mathematics of Computing
• Theory of Computation
• Methodologies
• Applications
• Computing Milieux

Highly-regarded as an essential resource for computer professionals, engineers, mathematicians, students and scientists, the Encyclopedia of Computer Science is a must-have reference for every college, university, business and high-school library.
... Read more

Customer Reviews (6)

The latest edition of the best basic reference on Computer Science
An excellent overview of Computer Science.

This really is an excellent basic reference for non-specialists who need to elaborate on Computer Science topics. This encyclopedia is comprehensive in its breadth of coverage, and directs the reader at the next level of depth through cross-reference to articles and bibliographic references for those who need to in-depth in an specific topic.

It will be a valuable part of your library if you are not a CS specialist have an interest on Computer Science subjects.

If you are a practitioner, you may do better with "The Engineering and Computer Science Handbook".

Excellent reference fo all aspects of Computer Science
I have as of this writing passed through about half of the encyclopedia and found it to be of the highest value. It has helped me to gain insights into areas that I am foggy in and also expanded my knowledge of areas in which I hold some expertise.

Ron Davis MCSE, MCSD, MCDBA, MCP+I, MCP+SB, MCT, CIW, CI, CTT

The wait is finally over
Two words for you - David Hemmindinger - Can this man edit or what?Was Very excited about the release of this book, excellent reference material.I think Dinger needs to write a book of his own next!I know I'll read it.

Excellent Reference Material
Have been using this for the past 7 years before going to Stanford andstill now.

A delicious "Brittanica" of computer science
I have the 1983 Second Edition and it is, as I assume the pricey Third is,a reference of biblical proportions, a sort of Brittanica of computer science. Lucid, authoritative articles. But while I lust after the new Edition, the three figure price makes me too shy to make a pass. Pity. If you can afford it, buy it. ... Read more

Book Description
A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford. ... Read more

Customer Reviews (1)

Flex your mind
This book is a gem of problem sets AND solutions, in the field of algorithms. The problems were from actual examinations given at Stanford in various computer science classes. About half the book is good descriptive text about the ideas that the problems probe. Certainly, well written, as befits Knuth's contribution.

But I would suggest to you that the best use of the book is in tackling those problems. In the spirit of Knuth's classic Art of Computer Programming series, where he gives extensive questions and answers.

I realise my suggestion may have appeal to only some of you. But I'm addressing my remarks to the smartest amongst you glancing at this. Test and improve your understanding of algorithms. ... Read more

Book Description
This book illustrates the mathematical concepts that a game developer would need to develop a professional-quality 3D engine. Although the book is geared toward applications in game development, many of the topics appeal to general interests in 3D graphics. It starts at a fairly basic level in areas such as vector geometry and linear algebra, and then progresses to more advanced topics in 3D programming such as illumination and visibility determination. Particular attention is given to derivations of key results, ensuring that the reader is not forced to endure gaps in the theory. The book assumes a working knowledge of trigonometry and calculus, but also includes sections that review the important tools used from these disciplines, such as trigonometric identities, differential equations, and the Taylor series.

Key Features:

* Concentrates on key mathematical topics for programming 3D game engines

* Discusses applications in the context of the OpenGL architecture due to its cross-platform nature and long-standing industry acceptance. Makes references to modern 3D hardware such as GeForce 3 from Nvidia

* Selected topics include Quaternions, Homogeneous Coordinates, Ray Tracing, Bump Mapping, Portal Systems, Polygonal Techniques, Shadows, and Physics

* Includes exercise sets for use as a textbook ... Read more

Customer Reviews (20)

Excellent source of applications for a Calc III class
If you're trying to find examples of 3D vector operations (dot and cross products, especially) that keep the interest of a mixed class of 18-25 year olds, this book is a fantastic source.If you're approaching the topic from the point of view of a programmer, trying to acquire the necessary math, it may be a bit dense.I'm sure many of the examples are now out-of-date, compared to current 3D implementations, but I learned quite a bit, anyway.

good reference for computer graphics math
like others books in charles media , written by someone in the industry , which means value infos will be in the book .
this book is good for someone studied linear algebra I,II + calculs courses and want to see the applied math in computer applications such as games .
i suggest before reading this book , reading a book about linear algebra + gemetry + calculs so as not to lost in that book because this book not for beginners in math .

Excellent
Excellent Book, I am very pleased with it and encourage it to anyone who already has ground knowledge in Trig + Calc.No fluffer in this book, all content and well written.

For a rock-solid understanding of 3D math
This book provides a solid foundation for anyone who wants to develop a good understanding of the math behind computer graphics. The author provides clear and concise explanations of the concepts covered, backs them up with mathematical proofs, and usually discusses how the concepts can be applied in games, often with sample code. Each chapter has accompanying exercises that I recommended working through.

The topics covered include things you would expect like matrices, vectors, transformations, 3D geometry, and lighting, but also includes are topics like collision detection, ray tracing, visibility determination, and techniques such as billboarding and shadows. It concludes with several chapters on physics including fluid simulation, and a few useful appendices covering trig, complex numbers, and Taylor series.

If you're brand new to graphics and game programming and haven't had a math class in a while, then the somewhat textbook-like language may be a little daunting, but otherwise, this book is an excellent resource for those interested in solidifying their knowledge of 3D math.

A Book for The Whole Life
Surely this is the book I was looking for.
Mostly of the 3D games books just presents codes and some few mentions to the maths techniques, without regarding the concepts behind them.
This one presents the Maths we use in 3D game development in such way that it does not bore the reader and yet makes him learn the math basis behind the 3D graphics programming, presenting, yet, some physics notes to implement a physics based engine.
If you just wanna code, certainly this is not the book for you, but if you are a serious developer (and programmer), surely this is the only book you should need. ... Read more

Book Description
A revision of the market leader, Kreyszig is known for its comprehensive coverage, careful and correct mathematics, outstanding exercises, helpful worked examples, and self-contained subject-matter parts for maximum teaching flexibility. The new edition provides invitations - not requirements - to use technology, as well as new conceptual problems, and new projects that focus on writing and working in teams. ... Read more

Customer Reviews (2)

Helpful
I found this book to be more of a help than the student solutions manual. It covers the material in the beginnings of the chapters (6-12 covered in this review) well and will help you check your work to make sure you are getting it right. It is sparse on the applied sections but does have hints and references to help you through the material.

Advanced Engineering Mathematics (6 edition)
De los textos que conozco de matemáticas avanzadas para ingeniería, me parece que es el mejor. Da un excelente desarrollo de las ecuaciones diferenciales ordinarias y parciales, obviamente desde el punto de vistaelemental. La parte de variable compleja, es la que más me gusta, es unbuen tratado de variable compleja, comparable con los textos(elementales)especializados en el tema. Un estudiante que trabaje lo deecuaciones diferenciales, análisis de Fourier y ecuaciones en derivadasparciales, lo de análisis complejo y numérico, adquiere unas buenas basesen la matemática aplicada a las ciencias e ingeniería. Además tiene unagran variedad de ejercicios y problemas, los cuales ayudan a un mejorentendimiento de la materia estudiada. Me gustaría conocer la octavaedición, pues los comentarios son con base en la sexta, debe haber varioscambios entre estas ediciones. ... Read more

Book Description
This self-contained book provides a systematic account of the main algorithms derived from the simplex method and the means by which they may be organized into effective procedures for solving practical linear programming problems on a computer.The book begins by characterizing the problem and the method used to solve it, going on to deal with the practicalities of the subject, emphasizing concerns of implementation.The final section of the book discusses the basic principles of optimization: duality, decomposition, and homotopy.In conjunction with the simplex method, they each lead to other key algorithms of linear programming. The author's approach is distinguished by his detailed exploration of ideas and issues that center on the need to structure data suitably, and to organize calculations in an efficient and numerically stable manner.Unlike many liner programming texts, the author's overall perspective is grounded in nonlinear programming rather than combinatorics. ... Read more

Book Description

Focussing on the manipulation and representation of geometrical objects, this book explores the application of geometry to computer graphics and computer-aided design (CAD).

Customer Reviews (1)

Good computer graphics text
This text has a novel approach to entry level computer graphics using homogeneous coordinates entirely.I struggled a bit with the use of these representations in perspective transformations.However once I got it I found the derivations and formulas to be easy to get and easy to use. The book has an extensive set of exercises with complete answers.I deducted one star because the theoretical aspects of homogeneous transformations could use expansion and simplification. ... Read more

Book Description

This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. They will find here current questions in Computer Science and the related modern and powerful mathematical methods. The range of applications is very wide and goes beyond Computer Science.

Product Description
This book is designed for a one- (or possibly two-) semester course in mathematics for those students who are interested in computer programming. Although there will be numerous references to computers throughout the book, it is designed to be a mathematics text.When talking about computer programming throughout the book, we will use a form of pseudo code, writing statements that roughly correspond to actual programming statements. This should make it easy for a student to change the pseudo code to whatever particular language is being used, if any. No prior programming knowledge is necessary. ... Read more

Book Description
Designed for those people who want to gain a practical knowledge of modern techniques, this book contains all the material necessary for a course on the numerical solution of differential equations. Written by two of the field's leading authorities, it provides a unified presentation of initial value and boundary value problems in ODEs as well as differential-algebraic equations. The approach is aimed at a thorough understanding of the issues and methods for practical computation while avoiding an extensive theorem-proof type of exposition. It also addresses reasons why existing software succeeds or fails. This is a practical and mathematically well informed introduction that emphasizes basic methods and theory, issues in the use and development of mathematical software, and examples from scientific engineering applications. Topics requiring an extensive amount of mathematical development are introduced, motivated, and included in the exercises, but a complete and rigorous mathematical presentation is referenced rather than included. ... Read more

Customer Reviews (1)

Its a handbook for numerical solutions of ODE & DAE.
This book is excellent.The concepts about stiff, initial value problems, boundary value problems and differential-Algebraic equations (DAE) is treated with relative deep.

The numerical methods for many cases is covered.

The bad is that don't show the code.The code is in a web (NETLIB) and is writed in Fortran Language.

Is very expensive! ... Read more

Book Description

Discrete Mathematics Using a Computer offers a new, "hands-on" approach to teaching Discrete Mathematics. Using software that is freely available on Mac, PC and Unix platforms, the functional language Haskell allows students to experiment with mathematical notations and concepts -- a practical approach that provides students with instant feedback and allows lecturers to monitor progress easily.

Customer Reviews (2)

From maths to software: elegant and clever
Discrete Mathematics Using a Computer is the best book I have seen so far when studying how to use the elegance of discrete mathematics (for example: list comprehension, recursion, sets, relations, trees) in programming. The book is exceptional in showing how you can transform mathematical thoughts into the functional programming language HASKELL without loosing the expressiveness of the mathematical formulation. The book shows how to write two- ore three-liners of compact, readable code that implements algorithms (like tree traversal) that usually takes at least a page or two of ugly "for-if-loop-code" in languages like C++ or Java. There are chapters on important applications of the proposed concepts for the design of digital circuits and for
AVL Trees. The text clearly shows the strengths of functional programming compared to imperative programming (Java, C, ...) for many programming tasks and it helps the programmer to better choose his tools.
Finally, the book contains clever and helpfull exercises with many answers. The book has a website providing dedicated code (HASKELL) for theexamples.

Pitiful excuse for a textbook
This book purports to be a college text for discrete math.It is terrible.There aren't nearly enough examples in the book.Explanations are woefully brief, giving one sentence to the definition of a set intersection, for example.Many new concepts sneak up on you without ever being discussed.In one instance it started using a point by point proof method without ever introducing that method.The rules given in some proofs are not defined earlier, leaving the reader to wonder what the authors are doing in their proof.The use of Haskel is another downside.There is no way to check your proofs aside from the proof checker software included which will drive a person to complete insanity.The software is so terribly picky in its syntax, you take more time verifying your proof than actually coming up with it.When there are errors with your syntax, it doesn't give a meaningful message.This is more the fault of Haskel, however.Nevertheless, it is the fault of the authors to choose this terrible method for teaching.Garbage. ... Read more

Customer Reviews (15)

Mathematical Structures For Computer Science Review
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
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
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.
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
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.
... Read more

Book Description
This textbook provides a comprehensive introduction to probability and stochastic processes, and shows how these subjects may be applied in computer performance modelling. The author's aim is to derive the theory in a way that combines its formal, intuitive, and applied aspects so that students may apply this indispensable tool in a variety of different settings. Readers are assumed to be familiar with elementary linear algebra and calculus, including the concept of limit, but otherwise this book provides a self-contained approach suitable for graduate or advanced undergraduate students. The first half of the book covers the basic concepts of probability including expectation, random variables, and fundamental theorems. In the second half of the book the reader is introduced to stochastic processes. Subjects covered include renewal processes, queueing theory, Markov processes, and reversibility as it applies to networks of queues. Examples and applications are drawn from problems in computer performance modelling. ... Read more

Customer Reviews (3)

Excellent Book
This book provides an excellent introduction to Discrete Distributions and their relationships in a sense that goes beyond the classical presenation in other text books. It has excellent introductory chapters on Markov Processes and Matrix Geormetric Systems. I think this book is a great book that can help in courses in Queuing and probability theory.

Great reference for probability and related studies.
I have not really read this book chapter by chapter, but I always found in this book the information I needed.I initially borrowed this book from library, only to find that I simply need this book to be on my shelf for convenient reference whenever I need to understand a concept or analysis I come across somewhere else!
I only use this book as a reference, but it is a good one.I do not give it 5 stars simply because I am not sure whether all the chapters in the book are equally well written.But for the chapters (or pages) I have read, it is a great one.

Comprehensive and systematic.
This book is suitable for my graduate studies on computer performance.The author directs us from combinatorics, distribution theory, queue theory to queueing networks in a systematic way.I have read the book at ease for its stepwise elaboration of concepts.However, I have also read with hardship as it requires the readers to possess a good command of mathematics, both pure and applied, in order to go through the book.

For a mathematics graduate studying computer networks, I recommend this book.A novice or a mediocrity should pay more patience to read if not yet at a loss.

This book has aroused my interest and eagerness to know more about computer performance from the viewpoint of queueing and networking.In a word, I enjoy reading this book. ... Read more

Book Description
Based on lectures given at Claremont McKenna College, this text constitutes a substantial, abstract introduction to linear algebra. The presentation emphasizes the structural elements over the computational - for example by connecting matrices to linear transformations from the outset - and prepares the student for further study of abstract mathematics. Uniquely among algebra texts at this level, it introduces group theory early in the discussion, as an example of the rigorous development of informal axiomatic systems. ... Read more

Customer Reviews (5)

the ideal book for beginning undergraduate students
I fully disagree with the one star review...
This is a beautiful book though you have to belong to a certain reader segment to appreciate it.
The readers that will like this book probabely are beginning undergraduate students that want to build a mathematical career and want a first and quick introduction to abstract mathematics. The reader is not overwhelmed by exotic topics that are rarely used, but is introduced to abstract basic principles needed to understand other courses like for instance quantum mechanics,more advanced graduate courses in algebra or functional analysis.
The power of this book is that it covers just enough material to have a solid foundation of algebra for other abstract courses like functional analysis,
When I compare it for instance with the book of Shilov, I strongly prefer this book since it is better organised, covers less topics, but enough to know the basics. This book succeeds in providing shorter proofs compared to Shilov without sacrifying rigor and clarity. How is this possible ?? Ah my friend, this is a reward coming from abstract reasoning as illustrated by this book.

Is this really good?
I have just had a glimpse of all the three reviews here, and wonder whether the reviews are really true. I am now an undergraduate and taking a course which uses this textbook. Frankly speaking, I think this book sucks. If you carefully compare this book with Friedberg, Insel and Spencer's Linear Algebra, you will know the difference. This book misses out many things I consider important. Also, it does not contain many interesting and essential results, like all infinite-dimensional vector space has a basis. I don't think Zorn's lemma should not be mentioned in a book like this one.
Also, I can't really accept that it starts matrices like that. We all know that matrices come from linear transformations. Matrix multiplication comes from the composition of linear transformatiosn. This book does not mention this and start it right away. This approach is quite bad in my opinion.
Finally, I think that this book is messy. I think it is quite difficult to include introduction of linear algebra and abstract algebra at the same time, but if it's so difficult to do it, why don't you study it separately? I think the author tried hard to combine these two stuff, but failed to do that successfully. All my friends who have linear algebra and abstract algebra background agree with me. I definitely wont' recommend this book.

excellent
This book treats the basic principles of abstract algebra.
It is targeted to graduate students that need a more theoretical approach to mathematics (instead of the usual calculus courses)
This book is the best introduction to abstract algebra for the following reasons

-its style : good introduction in each chapter, making the reader curious to read further.
-its rigor : everything is well explained in full details with proof.
-its elegance : This book treats the abstract structural aspects of algebra and then suddenly shows how more concrecte applications follow from these abstract results. This is the kind of elegance and style that makes mathematics an art : build a very abstract theory and then see how more concrete stuff follows immediately as special case of this abstract framework. This way, new things can be discovered and most of the time (as in this book), you can explain practical calculation rules in a short and rigorous way.

Definitely the finest there is ....

math is art ...
Great book !
If you read this book, you will not only gain knowledge of abstract algebra, but also understand clearly why mathematics is art. It was a real fun reading this book. The topics are presented in such a way that the author leads you to a climax, making you curious to read further, and help you to explore the beauty in all the ideas of abstract mathematics. This book is the best book I ever read on abstract algebra.

The emphasis in on rigor and abstract structural concepts. It is nice to see that the more practical applications follow as a special result from the abstract structural concepts. This is a very elegant approach !!

A Great Structural Approach to Linear Algebra!
As a person who has a healthy interest in mathematics and has taken many classes, this is definatley one of the best!Professor Valenza taught it (he has been teaching this Linear Algebra class at CMC for ten years) and his book is essentially an excellent compilation of the lecture notes from his class.It takes a very different tack from most linear algebra texts: Usually, a linear algebra text begins by inroducing matrices and solving simultaneous equations, teaching computational methods.Prof. Valenza starts with the structure BEHIND all of that math however: Sets, Groups, and Vector Space properties.This structure is absolutely essential to knowing what's going on: My father took a (less superior) linear algebra class many years ago, and he never understood the concepts behind the mathematical manipulations; I actually sat down with him and taught him the things that I learned in Prof. Valenza's class.I really think that the knowledge in this book is invaluable to someone who wants to know what Linear Algebra is really about.

Just a few examples of the truly deep knowledge that this book communicates follows.For instance (this will ring a bell for those who have taken calculus) the "constant of integration" that must be added when doing an antiderivative is actually a property of group homomorphisms.The "absolute value" that must be introduced when taking square roots is structurally THE SAME property of group homomorphisms.Also, we all know that you can't divide by zero; it's just not allowed.But, the reason for that is ultimatley rooted in group theory; namely, the real numbers are NOT a group under multiplication.This type understanding has EVERYTHING to do with matrices and systems of equations!For instance, the fact that only square matrices can be inverted is a trivial consequence of a property of function mappings called "bijectivity." (a mapping from three- to two- dimensional space can't be bijective, for example)Many seemingly complex linear system problems can be simplified to a trivial questions by, for example, investigating the "span" of the column vectors of a matrix.There are countless problems that simply can't be understood withoutthe kind of structural knowledge that Prof. Valenza's book gives.

Understanding the basic properties that underlie so many mathematical objects has been a true delight for me, and anyone who wants to know what is really going on "behind the scenes" with linear equations would be wise to investigate Prof. Valenza's book.It's no accident that he also wrote a book on Fourier Analysis; understanding structure is simply the key to higher math. ... Read more

Book Description
Susanna Epp's Discrete Mathematics with Applications, Second Edition provides a clear introduction to discrete mathematics.Epp has always been recognized for her lucid, accessible prose that explains complex, abstract concepts with clarity and precision.This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought.The text is suitable for many course structures, including one-semester or full-year classes.Its emphasis on reasoning provides strong preparation for computer science or more advanced mathematics courses. ... Read more

Customer Reviews (34)

This is when I fell in love with Math.
This book is well written, it contains good examples, and excellent exposition. This was my introduction to mathematical proofs, and after studying it well, I was able to approach more advanced courses, such as advanced calculus and modern algebra with a clear view of how to approach problems where a mathematical proof is needed. I highly recommend this book to undergraduate math majors.

Nice and Clear
I honestly can't see how you'd make a book explaining such topics as prime numbers and set theory any clearer than this one.I consider this to be a high quality book.It's easy to understand and reference.Its one drawback is that it covers only a limited number of topics, and none of them are heavy duty.If I found a book that explained graduate level math as well as this one explains undergraduate math, I'd consider it to be gold.

Good book IF you know how to use it.
This is a solid math book that covers every topic you'll need to know in the area. Make no mistake this is not a kid's book, and one must know how to study and read math in order to utilize it to the full potential. Many people that rate math books poorly do so because they have not developed adequate skills in studying math. If you take your time, work out the examples with the book, read and read again all of the concepts are about as clear as they can come from a math book. Most teachers/professors prefer to use their own examples, because that's how they abstract the problem in their own mind. It's easier to create a problem, than sit down and observe a premade example. Aside from some slightly screwy lesson organization it is a solid book. If you have patience, and try to do more than briefly skim over a lesson to understand it this book will be more than adequate for the topic.

Awful, even the prof said so
This book is horrible. I am a graduate software engineering student and took this course at a local university. The prof said that the book is horrible and used his own exaplainations and skipped the books explainations. If I was forced to use the book's explaination and examples I would be S.O.L. The only reason every discrete class uses this book is because there are no other discrete books in competition. If you are a comp sci student they should break discrete math classes apart to discrete for comp sci and discrete from math majors. They should also have comp sci teachers teaching this because math teachers don't usually have a clue how to relate discrete math to computer science.

Excellent Math Book
This is one of the best undergraduate math textbooks I have ever read. The concepts and examples provided by the author are very clear. Highly recommended for anyone who wants to learn Discrete Math. ... Read more

Book Description
This digital document is an article from Journal of Computers in Mathematics and Science Teaching, published by Thomson Gale on March 22, 2006. The length of the article is 4264 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

Citation Details
Title: An enhanced studio physics model: which technologies are productive?
Author: Gregory R. Mackinnon
Publication: Journal of Computers in Mathematics and Science Teaching (Magazine/Journal)
Date: March 22, 2006
Publisher: Thomson Gale
Volume: 25Issue: 1Page: 29(12)

Distributed by Thomson Gale ... Read more

Book Description

This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques. The book provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics.

Customer Reviews (39)

I despise this book
I've had this book for two semesters of a discrete mathematics course.The author is particularly fond of the word 'obviously'.The book includes a lot of proofs, but very poor explanation of how the author arrived at them.Every person I've ever met who used this book has absolutely hated it.

I suppose it depends on who is reviewing it.
I got something from the book even if it was mostly review
for me. I liked the recursion and graph sections.
I have Schaum's outlines:
1) Essential Computer Mathematics
2) Data Structures
That cover some but not all of the same material.
So why are the customer reviews so bad?
The notation is hard for those unfamiliar with it?
People with a good high school education should be able to get this is if it was taught well.
So I think the problem is that college prep math
is failing and college instructors are just as bad as they were in my time.
Don't blame it on the text if the problem is your preparation for the subject and your instructor?
This material is "need to know" for Mathematics and
Computer Science majors.
I thought it was pretty well done,
but I'm not answering the questions in a class room setting.
Maybe he tried to cover too much in one text?
It actually (laughing well) really needs a group theory section.

Garbage
This book epitomizes the common flaw in higher education today-expecting that an "expert in a field" makes them an "expert teacher".Bull.This book is written by someone who has decided to write a book 6 levels above the education of their readers just so they can prove a point at how smart they are.I'll bet Johnsonbaugh is the kind of guy that just stands at the board writing his notes that he could just give to you, just so he can hear the glory of his own voice.I have taken 4 semesters of calculus as an undergrad, as well as various science graduate courses and am LOST when reading this book.This book may be good for math "majors," but for people looking in other fields (Computer science, for example) it is terrible.

School administrators, take note:Find another book for your students.Just because this guy is an expert, doesn't mean he can come close to making everyone else one.Spend time studying the impact of this book, and you will see that this book is as effective in educating as a ruler to the knuckles.

Johnsonbaugh should stay where he belongs-in the lab, solving the world's math problems and leave teaching up to the teachers.

No Good
This book is horrible. He doesnt define the words that a bolded either. Most of the time he uses the proofs themselves to define a word. That doesnt help anything especially when the proofs are confusing too. It seems like when he explains something, he is really saying the same thing over and over again. It is impossible to understand this book.

The worst text book ever
My university requires this book for the discrete mathematics course.I have to tell you, this book teaches you absolutely nothing! The author barely explains things.And when he does explain things, he explains them as if the person reading already has an indepth knowledge of advanced math.There is no explaination as to how he arrived at answers at the back of the book.
I actually have to buy another book because I got so frustrated trying to learn this, that I ripped the book almost into shreds.And its only been two weeks into the term!I'm contemplating emailing the author to tell him to quit writing textbooks because this one is horrible.

My recommendation is not to buy this book unless you have no other choice. ... Read more

Book Description
This unique textbook, which is based on courses taught by the author to students in the US, UK and Europe, introduces the geometry, analysis and topology necessary to understand the mathematical framework for computer graphics. The topics covered range from symmetry and tilings to chaos and fractals, and the applications from computational geometry through numerical analysis to geometric modelling. Consequently it will be welcomed by mathematicians, computer scientists and engineers, whether students or professionals. ... Read more

Book Description
This digital document is an article from Journal of Computers in Mathematics and Science Teaching, published by Thomson Gale on June 22, 2006. The length of the article is 5547 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

Citation Details
Title: Correlates of achievement with online and classroom-based MBL physics activities.
Author: David Slykhuis
Publication: Journal of Computers in Mathematics and Science Teaching (Magazine/Journal)
Date: June 22, 2006
Publisher: Thomson Gale
Volume: 25Issue: 2Page: 147(17)

Distributed by Thomson Gale ... Read more