Isbn: 9780367549893 - discrete mathematics for computer science: an example-based introduction (19 risultati)

Softcover. Condizione: As New. First Edition. Small 4to 9" - 11" tall; 257 pages.

paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. pp. 272.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: New. pp. 272 1st edition.

Condizione: New. In.

Paperback. Condizione: New.

Condizione: New. pp. 272.

Paperback. Condizione: Brand New. 272 pages. 10.00x7.00x0.59 inches. In Stock.

Taschenbuch. Condizione: Neu. Discrete Mathematics for Computer Science | An Example-Based Introduction | Jon Pierre Fortney | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2020 | Chapman and Hall/CRC | EAN 9780367549893 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.…

PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 thinkingFilled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answersContains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocodeIncludes 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 numbersJon 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. 270 pp. Englisch.…

Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 engi. …

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 thinkingFilled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answersContains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocodeIncludes 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 numbersJon 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.…