Overview

Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises.

Full Product Details

Author:   Harry Lewis ,  Rachel Zax
Publisher:   Princeton University Press
Imprint:   Princeton University Press
ISBN:  

9780691179292

ISBN 10:   0691179298
Pages:   408
Publication Date:   19 March 2019
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Temporarily unavailable  
The supplier advises that this item is temporarily unavailable. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out to you.
Language:   English

Table of Contents

Reviews

Carefully constructed and elegantly written, this book delivers exactly what its title promises--an introductory treatment of all the essentials of discrete mathematics that a computer scientist needs to know. --David P. Williamson, Cornell University Finally, a book that covers discrete mathematics the way I like to teach it to students of computer science. --Saad Mneimneh, Hunter College, City University of New York This excellent book is an outstanding combination of clarity, rigor, and elegance. Lewis and Zax have produced a remarkably comprehensive guide to the world of discrete mathematics--a guide that will be invaluable for any student of computer science. --John MacCormick, Dickinson College Lewis and Zax give us a nice introduction to the essential concepts of discrete mathematics that any computer scientist should know. Their book presents a rigorous treatment of the important results, but it also goes beyond that by discussing the big picture behind the key ideas. Their explanations are at the perfect level for anyone with little background in mathematical proofs, making it ideal as a textbook or as supplementary reading. --Sa l A. Blanco, Indiana University

Lewis and Zax give us a nice introduction to the essential concepts of discrete mathematics that any computer scientist should know. Their book presents a rigorous treatment of the important results, but it also goes beyond that by discussing the big picture behind the key ideas. Their explanations are at the perfect level for anyone with little background in mathematical proofs, making it ideal as a textbook or as supplementary reading. --Sa l A. Blanco, Indiana University

Lewis and Zax give us a nice introduction to the essential concepts of discrete mathematics that any computer scientist should know. Their book presents a rigorous treatment of the important results, but it also goes beyond that by discussing the big picture behind the key ideas. Their explanations are at the perfect level for anyone with little background in mathematical proofs, making it ideal as a textbook or as supplementary reading. -Saul A. Blanco, Indiana University

Finally, a book that covers discrete mathematics the way I like to teach it to students of computer science. --Saad Mneimneh, Hunter College, City University of New York This excellent book is an outstanding combination of clarity, rigor, and elegance. Lewis and Zax have produced a remarkably comprehensive guide to the world of discrete mathematics--a guide that will be invaluable for any student of computer science. --John MacCormick, Dickinson College Lewis and Zax give us a nice introduction to the essential concepts of discrete mathematics that any computer scientist should know. Their book presents a rigorous treatment of the important results, but it also goes beyond that by discussing the big picture behind the key ideas. Their explanations are at the perfect level for anyone with little background in mathematical proofs, making it ideal as a textbook or as supplementary reading. --Sa l A. Blanco, Indiana University

Finally, a book that covers discrete mathematics the way I like to teach it to students of computer science. -Saad Mneimneh, Hunter College, City University of New York This excellent book is an outstanding combination of clarity, rigor, and elegance. Lewis and Zax have produced a remarkably comprehensive guide to the world of discrete mathematics-a guide that will be invaluable for any student of computer science. -John MacCormick, Dickinson College Lewis and Zax give us a nice introduction to the essential concepts of discrete mathematics that any computer scientist should know. Their book presents a rigorous treatment of the important results, but it also goes beyond that by discussing the big picture behind the key ideas. Their explanations are at the perfect level for anyone with little background in mathematical proofs, making it ideal as a textbook or as supplementary reading. -Saul A. Blanco, Indiana University

Finally, a book that covers discrete mathematics the way I like to teach it to students of computer science. Saad Mneimneh, Hunter College, City University of New York Lewis and Zax give us a nice introduction to the essential concepts of discrete mathematics that any computer scientist should know. Their book presents a rigorous treatment of the important results, but it also goes beyond that by discussing the big picture behind the key ideas. Their explanations are at the perfect level for anyone with little background in mathematical proofs, making it ideal as a textbook or as supplementary reading. Sadl A. Blanco, Indiana University This excellent book is an outstanding combination of clarity, rigor, and elegance. Lewis and Zax have produced a remarkably comprehensive guide to the world of discrete mathematics a guide that will be invaluable for any student of computer science. John MacCormick, Dickinson College Carefully constructed and elegantly written, this book delivers exactly what its title promises an introductory treatment of all the essentials of discrete mathematics that a computer scientist needs to know. David P. Williamson, Cornell University

Author Information

Harry Lewis is Gordon McKay Professor of Computer Science and former dean of Harvard College at Harvard University. His books include Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion. Rachel Zax is a software engineer at Google.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions