£24.11
  • RRP: £40.99
  • You Save: £16.88 (41%)
FREE Delivery in the UK.
Only 1 left in stock (more on the way).
Dispatched from and sold by Amazon. Gift-wrap available.
Mathematics of Discrete S... has been added to your Basket
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 3 images

Mathematics of Discrete Structures for Computer Science Hardcover – 9 Sep 2012


See all 3 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
Hardcover
£24.11
£24.11 £60.55
Note: This item is eligible for click and collect. Details
Pick up your parcel at a time and place that suits you.
  • Choose from over 13,000 locations across the UK
  • Prime members get unlimited deliveries at no additional cost
How to order to an Amazon Pickup Location?
  1. Find your preferred location and add it to your address book
  2. Dispatch to this address when you check out
Learn more

Great Discounts
Shop the Books Outlet. Discover some great deals on top titles. Shop now
click to open popover

Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone

To get the free app, enter your mobile phone number.



Product details

  • Hardcover: 312 pages
  • Publisher: Springer; 2012 ed. edition (9 Sept. 2012)
  • Language: English
  • ISBN-10: 3642298397
  • ISBN-13: 978-3642298394
  • Product Dimensions: 15.7 x 2.3 x 23.4 cm
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: 2,264,897 in Books (See Top 100 in Books)
  • Would you like to tell us about a lower price?
    If you are a seller for this product, would you like to suggest updates through seller support?

  • See Complete Table of Contents

Product description

Review

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 Back Cover

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.

See all Product description

Customer reviews

There are no customer reviews yet.
Share your thoughts with other customers

Most helpful customer reviews on Amazon.com

Amazon.com: 3.9 out of 5 stars 2 reviews
rohshall
5.0 out of 5 starsHidden gem
28 April 2014 - Published on Amazon.com
Verified Purchase
4 people found this helpful.
Z
3.0 out of 5 starsWouldn't recommend for self-study
15 October 2016 - Published on Amazon.com
Verified Purchase

Where's My Stuff?

Delivery and Returns

Need Help?