• Kapcsolat

  • Hírlevél

  • Rólunk

  • Szállítási lehetőségek

  • Prospero könyvpiaci podcast

  • Hírek

  • Discrete Mathematics for Computing

    Discrete Mathematics for Computing by Grossman, Peter;

      • 20% KEDVEZMÉNY?

      • A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.
      • Kiadói listaár GBP 64.99
      • Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.

        32 891 Ft (31 325 Ft + 5% áfa)
      • Kedvezmény(ek) 20% (cc. 6 578 Ft off)
      • Kedvezményes ár 26 313 Ft (25 060 Ft + 5% áfa)

    32 891 Ft

    db

    Beszerezhetőség

    Megrendelésre a kiadó utánnyomja a könyvet. Rendelhető, de a szokásosnál kicsit lassabban érkezik meg.

    Why don't you give exact delivery time?

    A beszerzés időigényét az eddigi tapasztalatokra alapozva adjuk meg. Azért becsült, mert a terméket külföldről hozzuk be, így a kiadó kiszolgálásának pillanatnyi gyorsaságától is függ. A megadottnál gyorsabb és lassabb szállítás is elképzelhető, de mindent megteszünk, hogy Ön a lehető leghamarabb jusson hozzá a termékhez.

    A termék adatai:

    • Kiadás sorszáma 3, Revised
    • Kiadó Red Globe Press
    • Megjelenés dátuma 2008. december 16.
    • Kötetek száma Paperback

    • ISBN 9780230216112
    • Kötéstípus Puhakötés
    • Terjedelem328 oldal
    • Méret 246x189 mm
    • Súly 594 g
    • Nyelv angol
    • 0

    Kategóriák

    Rövid leírás:


    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.

    Több

    Hosszú leírás:

    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.

    Több

    Tartalomjegyzék:

    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.

    Több