Discrete mathematics for computer science : an example-based introduction / Jon Pierre Fortney.
Fortney, Jon Pierre| Call Number | 004.0151 |
| Author | Fortney, Jon Pierre, author. |
| Title | Discrete mathematics for computer science : an example-based introduction / Jon Pierre Fortney. |
| Physical Description | 1 online resource : illustrations (black and white) |
| Summary | 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. |
| Subject | Computer science Mathematics. DISCRETE MATHEMATICS. MATHEMATICS / Discrete Mathematics COMPUTERS / Computer Science MATHEMATICS / Applied |
| Multimedia |
Total Ratings:
0
03714cam a22005778i 4500
001
vtls001592539
003
VRT
005
20220808223200.0
006
m o d
007
cr |||||||||||
008
220808s2021 flua o 000 0 eng d
020
$a 1000296806
020
$a 9781000296648 $q (PDF ebook)
020
$a 1000296644
020
$a 9781000296723 $q (Mobipocket ebook)
020
$a 1000296725
020
$a 9781003091479 $q (ebook)
020
$a 1003091474
020
$a 9781000296808 $q (electronic bk.)
020
$z 9780367549886 (hbk.)
020
$z 9780367549893 (pbk.)
024
7
$a 10.1201/9781003091479 $2 doi
035
$a (OCoLC)1202888145
035
$a (OCoLC-P)1202888145
035
$a (FlBoTFG)9781003091479
039
9
$a 202208082232 $b santha $y 202206301325 $z santha
040
$a OCoLC-P $b eng $e rda $e pn $c OCoLC-P
050
4
$a QA76.9.M35
072
7
$a MAT $x 008000 $2 bisacsh
072
7
$a COM $x 014000 $2 bisacsh
072
7
$a MAT $x 003000 $2 bisacsh
072
7
$a PBD $2 bicssc
082
0
4
$a 004.0151 $2 23
100
1
$a Fortney, Jon Pierre, $e author.
245
1
0
$a Discrete mathematics for computer science : $b an example-based introduction / $c Jon Pierre Fortney.
264
1
$a Boca Raton : $b Chapman & Hall/CRC, $c 2021.
300
$a 1 online resource : $b illustrations (black and white)
336
$a text $2 rdacontent
336
$a still image $2 rdacontent
337
$a computer $2 rdamedia
338
$a online resource $2 rdacarrier
520
$a 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.
588
$a OCLC-licensed vendor bibliographic record.
650
0
$a Computer science $x Mathematics.
650
0
$a DISCRETE MATHEMATICS.
650
7
$a MATHEMATICS / Discrete Mathematics $2 bisacsh
650
7
$a COMPUTERS / Computer Science $2 bisacsh
650
7
$a MATHEMATICS / Applied $2 bisacsh
856
4
0
$3 Taylor & Francis $u https://www.taylorfrancis.com/books/9781003091479
856
4
2
$3 OCLC metadata license agreement $u http://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
999
$a VIRTUA
No Reviews to Display
| Summary | 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. |
| Subject | Computer science Mathematics. DISCRETE MATHEMATICS. MATHEMATICS / Discrete Mathematics COMPUTERS / Computer Science MATHEMATICS / Applied |
| Multimedia |