Buy Discrete Mathematics for Computer Science: An Example-Based Introduction
1st Edition PDF ebook by author Jon Pierre Fortney – published by Chapman & Hall in 2021 and save up to 80% compared to the print version of this textbook. With PDF version of this textbook, not only save you money, you can also highlight, add text, underline add post-it notes, bookmarks to pages, instantly search for the major terms or chapter titles, etc.
You can search our site for other versions of the Discrete Mathematics for Computer Science: An Example-Based Introduction
1st Edition PDF ebook. You can also search for others PDF ebooks from publisher Chapman & Hall, as well as from your favorite authors. We have thousands of online textbooks and course materials (mostly in PDF) that you can download immediately after purchase.
Note: e-textBooks do not come with access codes, CDs/DVDs, workbooks, and other supplemental items.
eBook Details:
Full title: Discrete Mathematics for Computer Science: An Example-Based Introduction
1st Edition
Edition: 1st
Copyright year: 2021
Publisher: Chapman & Hall
Author: Jon Pierre Fortney
ISBN: 9780367549893, 9781000296808
Format: PDF
Description of Discrete Mathematics for Computer Science: An Example-Based Introduction
1st Edition:
Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.
