• Contact

  • Newsletter

  • About us

  • Delivery options

  • Prospero Book Market Podcast

  • News

  • Discrete Mathematics for Computing

    Discrete Mathematics for Computing by Grossman, Peter;

      • GET 20% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice GBP 64.99
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        32 891 Ft (31 325 Ft + 5% VAT)
      • Discount 20% (cc. 6 578 Ft off)
      • Discounted price 26 313 Ft (25 060 Ft + 5% VAT)

    32 891 Ft

    db

    Availability

    printed on demand

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Edition number 3, Revised
    • Publisher Red Globe Press
    • Date of Publication 16 December 2008
    • Number of Volumes Paperback

    • ISBN 9780230216112
    • Binding Paperback
    • No. of pages328 pages
    • Size 246x189 mm
    • Weight 594 g
    • Language English
    • 0

    Categories

    Short description:


    Discrete Mathematics for Computing presents the essential mathematics needed for the study of computing and information systems. The subject is covered in a gentle and informal style, but without compromising the need for correct methodology. It is perfect for students with a limited background in mathematics.


    This new edition includes:

    ? An expanded section on encryption
    ? Additional examples of the ways in which theory can be applied to problems in computing
    ? Many more exercises covering a range of levels, from the basic to the more advanced


    This book is ideal for students taking a one-semester introductory course in discrete mathematics - particularly for first year undergraduates studying Computing and Information Systems.


    PETER GROSSMAN has worked in both academic and industrial roles as a mathematician and computing professional. As a lecturer in mathematics, he was responsible for coordinating and developing mathematics courses for Computing students. He has also applied his skills in areas as diverse as calculator design, irrigation systems and underground mine layouts. He lives and works in Melbourne, Australia.

    More

    Long description:

    Discrete Mathematics for Computing presents the essential mathematics needed for the study of computing and information systems. The subject is covered in a gentle and informal style, but without compromising the need for correct methodology. It is perfect for students with a limited background in mathematics.

    This new edition includes:
    - An expanded section on encryption
    - Additional examples of the ways in which theory can be applied to problems in computing
    - Many more exercises covering a range of levels, from the basic to the more advanced

    This book is ideal for students taking a one-semester introductory course in discrete mathematics - particularly for first year undergraduates studying Computing and Information Systems.

    PETER GROSSMAN has worked in both academic and industrial roles as a mathematician and computing professional. As a lecturer in mathematics, he was responsible for coordinating and developing mathematics courses for Computing students. He has also applied his skills in areas as diverse as calculator design, irrigation systems and underground mine layouts. He lives and works in Melbourne, Australia.

    More

    Table of Contents:

    List of symbols
    Introduction to Algorithms
    Bases and Number Representation
    Computer Representation and Arithmetic
    Logic
    Sets and Relations
    Functions
    Induction and Recursion
    Boolean Algebra and Digital Circuits
    Combinatorics
    Introduction to Graph Theory
    Trees
    Number Theory
    Algorithms and Computational Complexity.

    More