Bild 1 von 1
Galerie
Bild 1 von 1
Mathematik diskreter Strukturen für die Informatik
US $55,92
Ca.CHF 45,68
oder Preisvorschlag
Bisher US $65,79 (- 15%)
Artikelzustand:
Gut
Buch, das gelesen wurde, sich aber in einem guten Zustand befindet. Der Einband weist nur sehr geringfügige Beschädigungen auf, wie z.B. kleinere Schrammen, er hat aber weder Löcher, noch ist er eingerissen. Bei gebundenen Büchern ist der Schutzumschlag möglicherweise nicht mehr vorhanden. Die Bindung weist geringfügige Gebrauchsspuren auf. Die Mehrzahl der Seiten ist unbeschädigt, das heißt, es gibt kaum Knitter oder Einrisse, es wurden nur in geringem Maße Bleistiftunterstreichungen im Text vorgenommen, es gibt keine Textmarkierungen und die Randbereiche sind nicht beschrieben. Alle Seiten sind vollständig vorhanden. Genauere Einzelheiten sowie eine Beschreibung eventueller Mängel entnehmen Sie bitte dem Angebot des Verkäufers.
- Sofort-KaufenMathematik diskreter Strukturen für die Informatik
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
Kostenlos USPS Media MailTM.
Standort: San Diego, California, USA
Lieferung:
Lieferung zwischen Di, 24. Jun und Sa, 28. Jun nach 94104 bei heutigem Zahlungseingang
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
Sicher einkaufen
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:326536008116
Artikelmerkmale
- Artikelzustand
- Release Year
- 2012
- Book Title
- Mathematics of Discrete Structures for Computer Science
- ISBN
- 9783642298394
Über dieses Produkt
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
3642298397
ISBN-13
9783642298394
eBay Product ID (ePID)
117213919
Product Key Features
Number of Pages
Xvi, 296 Pages
Language
English
Publication Name
Mathematics of Discrete Structures for Computer Science
Publication Year
2012
Subject
Computer Science, Logic, Applied, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics, Computers
Format
Hardcover
Dimensions
Item Weight
22.4 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2012-940954
Reviews
"Profound knowledge and skills in discrete mathematics are mandatory for a well educated computer scientist. Therefore a corresponding curriculum typically requires at least a basic course on this subject. This textbook, which is based on the lectures given by the author at the University of Malta, is a perfect companion for every student taking such a course. ... Besides a thorough formal presentation the book always gives a convincing motivation for studying the corresponding structures and explains the main ideas using illustrations. A well chosen set of exercises rounds off each topic. After studying the presented material a computer science student will be well prepared for further, more specialized courses." Martin Leucker, Lübeck, From the reviews: "Profound knowledge and skills in discrete mathematics are mandatory for a well educated computer scientist. Therefore a corresponding curriculum typically requires at least a basic course on this subject. This textbook, which is based on the lectures given by the author at theUniversity ofMalta, is a perfect companion for every student taking sucha course. ... Besides a thorough formal presentation the book always gives a convincing motivation for studying the corresponding structures and explains the main ideas using illustrations. A well chosen set of exercises rounds off each topic. After studying the presented material a computer science student will be well prepared for further, more specialized courses." [Martin Leucker, Lbeck] "The standard topics--including propositional logic, predicate calculus, sets, relations, discrete structures, defining new structured types, numbers, and reasoning about programs--are covered ... . As such, the book is suitable for students who understand algebra and can program. ... Teachers who use this text have noted how enthusiastically their students discuss its ideas in class. ... Overall, the book is well made." [Richard Botting, ACM Computing Reviews, December, 2012] "There is no doubt that discrete mathematics is a mandatory component of any good computer science program. Therefore, a textbook for this area is always very useful. ... this book particularly emphasizes the difference between the algorithmic and the descriptive approach. ... topics are well presented and can be used immediately for teaching such a course. It is also very helpful that many exercises are included into the text and support the learning process." [Christian Posthoff, Zentralblatt MATH, Vol. 1254, 2013] "Discrete mathematics is as essential for computer science as calculus is for physics. ... this book by Pace (Univ. of Malta) focuses on topics which are central to computer science, including the formal definition of data types and the use of induction to prove correctness. ... is most useful for future courses in programming languages, particularly those that use a language like Haskell. The book includes many helpful worked examples. Summing Up: Recommended. Lower-division undergraduates through researchers/faculty." [P. Cull, Choice, Vol. 50 (8), April, 2013] "Pace's Mathematics of Discrete Structures for Computer Science is a delightful book, written to be read and enjoyed as it moves from justifying the central place of maths in computing, through the usual set theory and logic, on to numbers, types and the halting problem." [Harold Thimbleby, Times Higher Education Supplement, 06/13], From the reviews: "Profound knowledge and skills in discrete mathematics are mandatory for a well educated computer scientist. Therefore a corresponding curriculum typically requires at least a basic course on this subject. This textbook, which is based on the lectures given by the author at the University of Malta, is a perfect companion for every student taking such a course. ... Besides a thorough formal presentation the book always gives a convincing motivation for studying the corresponding structures and explains the main ideas using illustrations. A well chosen set of exercises rounds off each topic. After studying the presented material a computer science student will be well prepared for further, more specialized courses." [Martin Leucker, Lübeck] "The standard topics--including propositional logic, predicate calculus, sets, relations, discrete structures, defining new structured types, numbers, and reasoning about programs--are covered ... . As such, the book is suitable for students who understand algebra and can program. ... Teachers who use this text have noted how enthusiastically their students discuss its ideas in class. ... Overall, the book is well made." [Richard Botting, ACM Computing Reviews, December, 2012] "There is no doubt that discrete mathematics is a mandatory component of any good computer science program. Therefore, a textbook for this area is always very useful. ... this book particularly emphasizes the difference between the algorithmic and the descriptive approach. ... topics are well presented and can be used immediately for teaching such a course. It is also very helpful that many exercises are included into the text and support the learning process." [Christian Posthoff, Zentralblatt MATH, Vol. 1254, 2013] "Discrete mathematics is as essential for computer science as calculus is for physics. ... this book by Pace (Univ. of Malta) focuses on topics which are central to computer science, including the formal definition of data types and the use of induction to prove correctness. ... is most useful for future courses in programming languages, particularly those that use a language like Haskell. The book includes many helpful worked examples. Summing Up: Recommended. Lower-division undergraduates through researchers/faculty." [P. Cull, Choice, Vol. 50 (8), April, 2013] "Pace's Mathematics of Discrete Structures for Computer Science is a delightful book, written to be read and enjoyed as it moves from justifying the central place of maths in computing, through the usual set theory and logic, on to numbers, types and the halting problem." [Harold Thimbleby, Times Higher Education Supplement, 06/13], From the reviews: "Pace's Mathematics of Discrete Structures for Computer Science is a delightful book, written to be read and enjoyed as it moves from justifying the central place of maths in computing, through the usual set theory and logic, on to numbers, types and the halting problem." [Harold Thimbleby, Times Higher Education Supplement, 06/13] "Discrete mathematics is as essential for computer science as calculus is for physics. ... this book by Pace (Univ. of Malta) focuses on topics which are central to computer science, including the formal definition of data types and the use of induction to prove correctness. ... is most useful for future courses in programming languages, particularly those that use a language like Haskell. The book includes many helpful worked examples. Summing Up: Recommended. Lower-division undergraduates through researchers/faculty." [P. Cull, Choice, Vol. 50 (8), April, 2013] "There is no doubt that discrete mathematics is a mandatory component of any good computer science program. Therefore, a textbook for this area is always very useful. ... this book particularly emphasizes the difference between the algorithmic and the descriptive approach. ... topics are well presented and can be used immediately for teaching such a course. It is also very helpful that many exercises are included into the text and support the learning process." [Christian Posthoff, Zentralblatt MATH, Vol. 1254, 2013] "The overwhelming majority of the subjects is discussed from an algorithmic viewpoint, considering how we could use this or that result while writing code for a computer. ... you want to teach a course focusing on how to use discrete structures in computer science, then the book is a concise, low-cost alternative to textbooks in discrete mathematics." (Miklós Bóna, MAA Reviews, December, 2012) "The standard topics--including propositional logic, predicate calculus, sets, relations, discrete structures, defining new structured types, numbers, and reasoning about programs--are covered ... . As such, the book is suitable for students who understand algebra and can program. ... Teachers who use this text have noted how enthusiastically their students discuss its ideas in class. ... Overall, the book is well made." [Richard Botting, ACM Computing Reviews, December, 2012] "Profound knowledge and skills in discrete mathematics are mandatory for a well educated computer scientist. Therefore a corresponding curriculum typically requires at least a basic course on this subject. This textbook, which is based on the lectures given by the author at the University of Malta, is a perfect companion for every student taking such a course. ... Besides a thorough formal presentation the book always gives a convincing motivation for studying the corresponding structures and explains the main ideas using illustrations. A well chosen set of exercises rounds off each topic. After studying the presented material a computer science student will be well prepared for further, more specialized courses." [Martin Leucker, Lübeck], From the reviews: "Pace's Mathematics of Discrete Structures for Computer Science is a delightful book, written to be read and enjoyed as it moves from justifying the central place of maths in computing, through the usual set theory and logic, on to numbers, types and the halting problem." [Harold Thimbleby, Times Higher Education Supplement, 06/13] "Discrete mathematics is as essential for computer science as calculus is for physics. ... this book by Pace (Univ. of Malta) focuses on topics which are central to computer science, including the formal definition of data types and the use of induction to prove correctness. ... is most useful for future courses in programming languages, particularly those that use a language like Haskell. The book includes many helpful worked examples. Summing Up: Recommended. Lower-division undergraduates through researchers/faculty." [P. Cull, Choice, Vol. 50 (8), April, 2013] "There is no doubt that discrete mathematics is a mandatory component of any good computer science program. Therefore, a textbook for this area is always very useful. ... this book particularly emphasizes the difference between the algorithmic and the descriptive approach. ... topics are well presented and can be used immediately for teaching such a course. It is also very helpful that many exercises are included into the text and support the learning process." [Christian Posthoff, Zentralblatt MATH, Vol. 1254, 2013] "The overwhelming majority of the subjects is discussed from an algorithmic viewpoint, considering how we could use this or that result while writing code for a computer. ... you want to teach a course focusing on how to use discrete structures in computer science, then the book is a concise, low-cost alternative to textbooks in discrete mathematics." (Mikls Bna, MAA Reviews, December, 2012) "The standard topics--including propositional logic, predicate calculus, sets, relations, discrete structures, defining new structured types, numbers, and reasoning about programs--are covered ... . As such, the book is suitable for students who understand algebra and can program. ... Teachers who use this text have noted how enthusiastically their students discuss its ideas in class. ... Overall, the book is well made." [Richard Botting, ACM Computing Reviews, December, 2012] "Profound knowledge and skills in discrete mathematics are mandatory for a well educated computer scientist. Therefore a corresponding curriculum typically requires at least a basic course on this subject. This textbook, which is based on the lectures given by the author at the University of Malta, is a perfect companion for every student taking such a course. ... Besides a thorough formal presentation the book always gives a convincing motivation for studying the corresponding structures and explains the main ideas using illustrations. A well chosen set of exercises rounds off each topic. After studying the presented material a computer science student will be well prepared for further, more specialized courses." [Martin Leucker, Lbeck], From the reviews:"Profound knowledge and skills in discrete mathematics are mandatory for a well educated computer scientist. Therefore a corresponding curriculum typically requires at least a basic course on this subject. This textbook, which is based on the lectures given by the author at the University of Malta, is a perfect companion for every student taking such a course. ... Besides a thorough formal presentation the book always gives a convincing motivation for studying the corresponding structures and explains the main ideas using illustrations. A well chosen set of exercises rounds off each topic. After studying the presented material a computer science student will be well prepared for further, more specialized courses." Martin Leucker, LübeckThe standard topics--including propositional logic, predicate calculus, sets, relations, discrete structures, defining new structured types, numbers, and reasoning about programs--are covered … . As such, the book is suitable for students who understand algebra and can program. … Teachers who use this text have noted how enthusiastically their students discuss its ideas in class. … Overall, the book is well made. (Richard Botting, ACM Computing Reviews, December, 2012)There is no doubt that discrete mathematics is a mandatory component of any good computer science program. Therefore, a textbook for this area is always very useful. … this book particularly emphasizes the difference between the algorithmic and the descriptive approach. … topics are well presented and can be used immediately for teaching such a course. It is also very helpful that many exercises are included into the text and support the learning process. (Christian Posthoff, Zentralblatt MATH, Vol. 1254, 2013)
Number of Volumes
1 vol.
Illustrated
Yes
Table Of Content
Why Mathematics'.- Propositional Logic.- Predicate Calculus.- Sets.- Relations.- Classifying Relations.- More Discrete Structures.- Defining New Structured Types.- Numbers.- Reasoning About Programs.- Index.
Synopsis
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science. The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs. The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering., Approaching mathematics from a computer science viewpoint, this book defines ways of calculating the results of applying the operators, then shows how they satisfy various properties. The comprehensive text is supplemented with summaries, proofs and exercises., Why Mathematics?.- Propositional Logic.- Predicate Calculus.- Sets.- Relations.- Classifying Relations.- More Discrete Structures.- Defining New Structured Types.- Numbers.- Reasoning About Programs.- Index.
LC Classification Number
QA76.9.M35
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
Books for Ages
99,1% positive Bewertungen•55 Tsd. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Beliebte Kategorien in diesem Shop
Verkäuferbewertungen (14'804)
- d***e (3404)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGood
- a***s (139)- Bewertung vom Käufer.Letzter MonatBestätigter KaufThank you!!
- s***i (83)- Bewertung vom Käufer.Letzter MonatBestätigter KaufPERFECT!
Noch mehr entdecken:
- Science-Fiction-Belletristik Romane,
- Science-Fiction-Belletristik-Jugendliche Romane,
- Bücher über Literatur Science-Fiction-Belletristik,
- Science-Fiction-Belletristik-Bücher auf Deutsch,
- Isaac-Asimov-Science-Fiction - Belletristik-Bücher,
- Science-Fiction-Belletristik-HarperCollins Bücher,
- Michael-Crichton-Science-Fiction - Belletristik-Bücher,
- Ray-Bradbury-Science-Fiction - Belletristik-Bücher,
- Star Trek Science-Fiction-Bücher mit Belletristik-Genre,
- Romane & Erzählungen für Kinder & Jugendliche Jugendliche Science-Fiction
Books for Ages
99,1% positive Bewertungen•55 Tsd. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Beliebte Kategorien in diesem Shop
Verkäuferbewertungen (14'804)
- d***e (3404)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGood
- a***s (139)- Bewertung vom Käufer.Letzter MonatBestätigter KaufThank you!!
- s***i (83)- Bewertung vom Käufer.Letzter MonatBestätigter KaufPERFECT!