Thoroughly updated, the new Third Edition of Discrete Structures, Logic, and Computability introduces beginning computer science and computer engineering students to the fundamental techniques and ideas used by computer scientists today, focusing on topics from the fields of mathematics, logic, and computer science itself. Dr. Hein provides elementary introductions to those ideas and techniques that are necessary to understand and practice the art and science of computing. The text contains all the topics for discrete structures in the reports of the IEEE/ACM Joint Task Force on Computing Curricula for computer science programs and for computer engineering programs.
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||
 Sell Back Your Copy for $15.98
Whether you buy it used on Amazon for $34.12 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $15.98.
Used Price$34.12
Trade-in Price$15.98
Price after
Trade-in$18.14 |
Book Description
Frequently Bought Together
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
17 of 18 people found the following review helpful:
5.0 out of 5 stars
Discrete math for real software engineers,
By Rex L Page (Norman, Oklahoma) - See all my reviews
This review is from: Discrete Structures, Logic and Computability (Hardcover)
Software designs must address trade-offs among factors such as performance, usability, completeness, timeliness, correctness and so on. Judging from the number of bugs people encounter, software engineers seem to be trading away too much of the correctness factor for something else.Hein's text addresses this issue by placing much greater emphasis on ideas from logic and methods of proof than most other books on discrete mathematics, such as the popular text by Rosen. In addition, Hein includes material relating important software concepts to abstract algebra, and he does this without slighting other common topics of discrete mathematics, such as sets, relations, functions, counting, automata, and computability. Software engineers who have learned from Hein's text will have practical tools that they can use to deal with the software correctness factor more effectively. Besides all of these good qualities, the text is well organized, clearly written, and punctuated with deligtfully subtle humor. I plan to use it.
15 of 21 people found the following review helpful:
4.0 out of 5 stars
A Good Text,
By Janet Vorvick (Portland, OR USA) - See all my reviews
This review is from: Discrete Structures, Logic and Computability (Hardcover)
I've taught from this text for 8 years. The excellent students have no problem with it. The average students complain that it is hard to understand. I don't think any text covering these topics could be easier to understand, actually.There are plenty of examples in the text. However, the exercises tend to be significantly more complex than the examples. The answers to many exercises are in the back of the book, which is a great help to students.
1 of 1 people found the following review helpful:
3.0 out of 5 stars
Functional, but overly formal.,
This review is from: Discrete Structures, Logic, and Computability (Hardcover)
I'm required to use this book as I go to Portland State University where Hein taught for a while. The examples are helpful, but often I find the formal definitions hard to follow. I'm not the only one who has mentioned this about the book in my classes...we use it for 3 quarters.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
analyzing algorithms, topological sorting, starting stack symbol, queue algebra, indirect left recursion, immediate left recursion, following wff, morphism from the algebra, lambda closure, propositional wffs, derivation from the premise, poset diagram, original wff, conditional proof rule, clausal notation, fundamental conjunction, new start state, equivalent wff, big theta, prenex conjunctive normal form, kernel relation, decision problems that can, rightmost derivation, initial stack symbol, other wffs Key Phrases - Capitalized Phrases (CAPs): (learn more)
Grammar Let, Pacific Ocean, Here's the Prolog, Formalizing English Sentences, United States, Construction We'll, Discrete Probability, Big Omega Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
analyzing algorithms, topological sorting, starting stack symbol, queue algebra, indirect left recursion, immediate left recursion, following wff, morphism from the algebra, lambda closure, propositional wffs, derivation from the premise, poset diagram, original wff, conditional proof rule, clausal notation, fundamental conjunction, new start state, equivalent wff, big theta, prenex conjunctive normal form, kernel relation, decision problems that can, rightmost derivation, initial stack symbol, other wffs Key Phrases - Capitalized Phrases (CAPs): (learn more)
Grammar Let, Pacific Ocean, Here's the Prolog, Formalizing English Sentences, United States, Construction We'll, Discrete Probability, Big Omega Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
