Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Discrete Mathematics for Computer Science (with Student Solutions Manual CD-ROM) [Hardcover]

Gary Haggard , John Schlipf , Sue Whitesides

List Price: CDN$ 210.95
Price: CDN$ 195.15 & FREE Shipping. Details
You Save: CDN$ 15.80 (7%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.ca. Gift-wrap available.
Want it delivered Friday, August 1? Choose One-Day Shipping at checkout.

Formats

Amazon Price New from Used from
Hardcover CDN $195.15  
Multimedia CD --  
Join Amazon Student in Canada


Book Description

Feb. 1 2005 053449501X 978-0534495015 1
Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE with Student Solutions Manual CD-ROM! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mathematics will help you develop important reasoning skills that will continue to be useful throughout your career.

Customers Who Bought This Item Also Bought


Product Details


Product Description

Review

1. SETS, PROOF TEMPLATES, AND INDUCTION. Basic Definitions. Exercises. Operations on Sets. Exercises. The Principle of Inclusion-Exclusion. Exercises. Mathematical Induction. Program Correctness. Exercises. Strong Form of Mathematical Induction. Exercises. Chapter Review. 2. FORMAL LOGIC. Introduction to Propositional Logic. Exercises. Truth and Logical Truth. Exercises. Normal Forms. Exercises. Predicates and Quantification. Exercises. Chapter Review. 3. RELATIONS. Binary Relations. Operations on Binary Relations. Exercises. Special Types of Relations. Exercises. Equivalence Relations. Exercises. Ordering Relations. Exercises. Relational Databases: An Introduction. Exercises. Chapter Review. 4. FUNCTIONS. Basic Definitions. Exercises. Operations on Functions. Sequences and Subsequences. Exercises. The Pigeon-Hole Principle. Exercises. Countable and Uncountable Sets. Exercises. Chapter Review. 5. ANALYSIS OF ALGORITHMS. Comparing Growth Rates of Functions. Exercises. Complexity of Programs. Exercises. Uncomputability. Chapter Review. 6. GRAPH THEORY. Introduction to Graph Theory. The Handshaking Problem. Paths and Cycles. Graph Isomorphism. Representation of Graphs. Exercises. Connected Graphs. The Konigsberg Bridge Problem. Exercises. Trees. Spanning Trees. Rooted Trees. Exercises. Directed Graphs. Applications: Scheduling a Meeting Facility. Finding a Cycle in a Directed Graph. Priority in Scheduling. Connectivity in Directed Graphs. Eulerian Circuits in Directed Graphs. Exercises. Chapter Review. 7. COUNTING AND COMBINATORICS. Traveling Salesperson. Counting Principles. Set Decomposition Principle. Exercises. Permutations and Combinations. Constructing the kth Permutation. Exercises. Counting with Repeated Objects. Combinatorial Identities. Pascal?s Triangle. Exercises. Chapter Review. 8. DISCRETE PROBABILITY. Ideas of Chance in Computer Science. Exercises. Cross Product Sample Spaces. Exercises. Independent Events and Conditional Probability. Exercises. Discrete Random Variables. Exercises. Variance, Standard Deviation, and the Law of Averages. Exercises. Chapter Review. 9. RECURRENCE RELATIONS. The Tower of Hanoi Problem. Solving First-Order Recurrence Relations. Exercises. Second-Order Recurrence Relations. Exercises. Divide-and-Conquer Paradigm. Binary Search. Merge Sort. Multiplication of n-Bit Numbers. Divide-and-Conquer Recurrence Relations. Exercises. Chapter Review.

About the Author

Gary Haggard is Professor of Computer Science at Bucknell University. His research in data structures focuses on the implementation of effective algorithms for computing invariants for large combinatorial structures such as graphs. Dr. Haggard¿s current work is directed towards finding chromatic polynomials of large graphs.

John Schlipf is a Professor of Computer Science in the Department of Electrical and Computer Engineering and Computer Science at the University of Cincinnati. His research interests include logic programming and deductive databases, algorithms for satisfiability, computability and complexity, formal verification, and model theory.

Sue Whitesides is Professor of Computer Science at McGill University. She holds a Ph.D. from University of Wisconsin and a Masters from Stanford University. Her research interests lie within combinatorial mathematics and theoretical computer science.

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 Reviews

There are no customer reviews yet on Amazon.ca
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com: 2.7 out of 5 stars  3 reviews
1 of 1 people found the following review helpful
2.0 out of 5 stars A text for the masochistic learner Jan. 14 2014
By Jwheezy - Published on Amazon.com
Format:Hardcover
This was a required textbook for a course at my university. My professor pulled all the homework from the ends of each chapter. This part of the book is one of my biggest gripes. The reading sections of this book pack a large amount of material in a brief page or two for each section followed by homework exercises. The exercise sections have are about as long as the actual information sections, meaning they are packed with questions. This would be a positive for this book except the questions aren't similar, so the included CD with the odd problems solved will often be of little help because question 3 will be a completely different sort of problem than question 4. Since each problem is so unique, you'll often be left dealing with problems that are considerably more complex than anything found in the reading sections of the text. If you are using the questions of this book for homework, be prepared to use google extensively. As an example, the book may explain how to perform an operation on 2 sets of numbers. Then in the homework, it will ask you to perform the same operation on 5 sets abstract sets without ever explaining how to go about doing that.

I ended up receiving an A in the course, but that was after spending ~8 hours for each 10-14 question homework. Most of that time was spent on the internet trying to learn the material from whatever sites I could find. The reading sections of this text are an excersize in frustration. In one of the explanations for a concept in the book, the author literally uses the phrase "from [problem], it is obvious that the answer is [answer]." That was the entire explanation on the topic. A textbook should never say the phrase "from X, it is obvious that Y" if the whole section is supposed to be telling you how to find Y from X in the first place. This is an introductory text into formal logic, proofs, and set mathematics. Yet, you'll often find that the author skips steps in his solutions which may be obvious to someone familiar with the material but that is obviously not the target of this text. There is an occasional table for reference which doesn't explain what the relationship between anything on the table is (I'm looking at you, Table of Commonly Used Tautologies....). This book covers a great number of topics in a fairly small book, for a textbook that is. However, this book suffers from a lack of depth necessary to reach its potential.

If you have a choice, skip this text. If, like me, you are required to use this text.... Google everything and god help you.
1.0 out of 5 stars Extremely poor organization. Jan. 13 2014
By Dan G. - Published on Amazon.com
Format:Hardcover|Verified Purchase
This book has an extremely poor organization of information. It's like the authors just threw a bunch of information at the book without thinking about how a student has to go through learning the mathematical concepts. The only reason I have to use this book is because a professor from my university was one of the authors. Get another book on discrete mathematics if you want to really learn the material.
1 of 8 people found the following review helpful
5.0 out of 5 stars Great Textbook Sept. 7 2011
By mfox - Published on Amazon.com
Format:Hardcover|Verified Purchase
This textbook was the exact same one I needed for class and was MUCH cheaper than buying from the school store. It was even in better condition than what was advertised! I would definitely recommend this book.

Look for similar items by category


Feedback