logo
Product categories

EbookNice.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link.  https://ebooknice.com/page/post?id=faq


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookNice Team

(Ebook) Discrete Mathematics for Computer Science by Jon Pierre Fortney ISBN 9780367549886, 9780367549893, 9781003091479, 0367549883, 0367549891, 1003091474

  • SKU: EBN-22502498
Zoomable Image
$ 32 $ 40 (-20%)

Status:

Available

4.7

24 reviews
Instant download (eBook) Discrete Mathematics for Computer Science after payment.
Authors:Jon Pierre Fortney
Pages:270 pages.
Year:2020
Editon:1
Publisher:CRC Press
Language:english
File Size:9.43 MB
Format:pdf
ISBNS:9780367549886, 9780367549893, 9781003091479, 0367549883, 0367549891, 1003091474
Categories: Ebooks

Product desciption

(Ebook) Discrete Mathematics for Computer Science by Jon Pierre Fortney ISBN 9780367549886, 9780367549893, 9781003091479, 0367549883, 0367549891, 1003091474

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.
*Free conversion of into popular formats such as PDF, DOCX, DOC, AZW, EPUB, and MOBI after payment.

Related Products