Home » Discrete Mathematics for Computer Science
Product Image

Discrete Mathematics for Computer Science

Jon Pierre Fortney
€210.80
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Jon Pierre Fortney
Adjacency Matrix
Algorithm control structures
Author_Jon Pierre Fortney
Binary Numbers
Boolean Algebra
Boolean Expressions
Category=PBD
Category=PBW
Category=UY
Category=UYA
combinatorial analysis
Computer science
Computer Science Majors
Conditional Controls
Connected Graph
Decimal Numbers
Discrete mathematics
discrete structures for computer science students
Edge Set
Edges Incident
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Euler Circuit
Euler Path
Eulerian Graph
Expression Tree
Hexadecimal Numbers
Input String
logic gates
mathematical proofs
Octal Numbers
Prim's Algorithm
pseudocode examples
Reachability Matrix
Set
set operations
Spanning Tree
Time Complexity Function
Truth Table
undergraduate mathematics
Vertex Set
Weighted Graph

Product details

  • ISBN 9780367549886
  • Weight: 453g
  • Dimensions: 178 x 254mm
  • Publication Date: 24 Dec 2020
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns
Description

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.
About Jon Pierre Fortney

Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a B.A. in Mathematics and Actuarial Science and a B.S.E. 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 Ph.D. in Mathematics, specializing in Geometric Mechanics. Since 2012 he has worked at Zayed University in Dubai. This is his second mathematics textbook.

More from this author