000 | 03582cam a22005418i 4500 | ||
---|---|---|---|
001 | 9781003091479 | ||
003 | FlBoTFG | ||
005 | 20220509193036.0 | ||
006 | m o d | ||
007 | cr ||||||||||| | ||
008 | 201006s2021 flua o 000 0 eng d | ||
040 |
_aOCoLC-P _beng _erda _epn _cOCoLC-P |
||
020 | _a1000296806 | ||
020 |
_a9781000296648 _q(PDF ebook) |
||
020 | _a1000296644 | ||
020 |
_a9781000296723 _q(Mobipocket ebook) |
||
020 | _a1000296725 | ||
020 |
_a9781003091479 _q(ebook) |
||
020 | _a1003091474 | ||
020 |
_a9781000296808 _q(electronic bk.) |
||
020 | _z9780367549886 (hbk.) | ||
020 | _z9780367549893 (pbk.) | ||
024 | 7 |
_a10.1201/9781003091479 _2doi |
|
035 | _a(OCoLC)1202888145 | ||
035 | _a(OCoLC-P)1202888145 | ||
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aMAT _x008000 _2bisacsh |
|
072 | 7 |
_aCOM _x014000 _2bisacsh |
|
072 | 7 |
_aMAT _x003000 _2bisacsh |
|
072 | 7 |
_aPBD _2bicssc |
|
082 | 0 | 4 |
_a004.0151 _223 |
100 | 1 |
_aFortney, Jon Pierre, _eauthor. |
|
245 | 1 | 0 |
_aDiscrete mathematics for computer science : _ban example-based introduction / _cJon Pierre Fortney. |
264 | 1 |
_aBoca Raton : _bChapman & Hall/CRC, _c2021. |
|
300 |
_a1 online resource : _billustrations (black and white) |
||
336 |
_atext _2rdacontent |
||
336 |
_astill image _2rdacontent |
||
337 |
_acomputer _2rdamedia |
||
338 |
_aonline resource _2rdacarrier |
||
520 | _aDiscrete 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 | _aOCLC-licensed vendor bibliographic record. | ||
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 7 |
_aMATHEMATICS / Discrete Mathematics _2bisacsh |
|
650 | 7 |
_aCOMPUTERS / Computer Science _2bisacsh |
|
650 | 7 |
_aMATHEMATICS / Applied _2bisacsh |
|
856 | 4 | 0 |
_3Taylor & Francis _uhttps://www.taylorfrancis.com/books/9781003091479 |
856 | 4 | 2 |
_3OCLC metadata license agreement _uhttp://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf |
999 |
_c128733 _d128733 |