Notifications can be turned off anytime from settings.
Item(s) Added To cart
Qty.
Something went wrong. Please refresh the page and try again.
Something went wrong. Please refresh the page and try again.
Exchange offer not applicable. New product price is lower than exchange product price
Please check the updated No Cost EMI details on the payment page
Exchange offer is not applicable with this product
Exchange Offer cannot be clubbed with Bajaj Finserv for this product
Product price & seller has been updated as per Bajaj Finserv EMI option
Please apply exchange offer again
Your item has been added to Shortlist.
View AllYour Item has been added to Shopping List
View All
No Cost EMI of Zero Emi Vendor applied on the product
You selected EMI of for monthsChangeGenerally delivered in 5 - 8 days
Item is available at . Change
You will be notified when this product will be in stock
|
Far more “user friendly” than the vast majority of similar books, this text is truly written with the “beginning” reader in mind. The pace is tight, the style is light, and the text emphasizes theorem proving throughout. The authors emphasize "Active Reading,” a skill vital to success in learning how to think mathematically (and write clean, error-free programs).
Features
1. A friendly, conversational, humorous style – Makes this top seller stimulating and engaging for the reader.
2. More than 150 Pauses (short questions) – Inserted at strategic points. Full solutions to Pauses are included at the end of each section.
3. Emphasis on writing and critical-thinking skills.
4. More than 300 worked examples and 3500 exercises. The problem sets are carefully graded by level of difficulty.
5. A FREE Student Solutions Manual is built into the back of the text.
6. Topics in discrete math are used as a vehicle for teaching proofs.
7. An unusually strong emphasis on graph theory, incorporating its coverage throughout six chapters.
8. A glossary of definitions and a list of symbols and notation.
About the Author
Edgar Goodaire--Honorary Research Professor (retired). PhD British Columbia, 1973 B.Sc. Toronto, 1969. CMS Distinguished Service Award, 2004.
Table of Contents:
Chapter 1. Logic
Chapter 2. Sets and Relations
Chapter 3. Functions
Chapter 4. The Integers
Chapter 5. Induction and Recursion
Chapter 6. Principles of Counting
Chapter 7. Permutations and Combinations
Chapter 8. Algorithms
Chapter 9. Graphs
Chapter 10. Paths and Circuits
Chapter 11. Applications of Paths and Circuits
Chapter 12. Trees
Chapter 13. Planar Graphs and Colorings
Chapter 14. The Max Flow -- Min Cut Theorem
The images represent actual product though color of the image and product may slightly differ.
Discrete Mathematics with Graph Theory | Third Edition| By Pearson
Rs. 538
Register now to get updates on promotions and
coupons. Or Download App