
Discrete Mathematics for Computing
Peter Grossman(Author)
Palgrave Macmillan (Publisher)
2nd Edition
Published on 16. August 2002
Book
Paperback/Softback
320 pages
978-0-333-98111-5 (ISBN)
Article exhausted; check for reprint
Description
Written with a clear and informal style "Discrete Mathematics for Computing" is aimed at first-year undergraduate computing students with very little mathematical background. It is a low-level introductory text which takes the topics at a gentle pace, covering all the essential material that forms the background for studies in computing and information systems. This edition includes new sections on proof methods and recurrences, and the examples have been updated throughout to reflect the changes in computing since the first edition.
More details
Series
Edition
2nd Revised edition
Language
English
Place of publication
Basingstoke
United Kingdom
Target group
College/higher education
Edition type
Revised edition
Illustrations
Illustrations
Dimensions
Height: 246 mm
Width: 189 mm
Weight
626 gr
ISBN-13
978-0-333-98111-5 (9780333981115)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions

Peter Grossman
Discrete Mathematics for Computing
Book
12/2008
3rd Edition
Red Globe Press
€94.50
Shipment within 15-20 days
Previous edition

Peter Grossman
Discrete Mathematics for Computing
Book
03/1995
Palgrave Macmillan
€28.46
Article exhausted; check for reprint
Person
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 co-ordination and subject development of mathematics subjects for Computing students. He currently works in industry, in the areas of mathematical modelling and software development.
Content
List of Symbols - Preface - Bases and Number Representation - Computer Representation and Arithmetic - Logic - Sets and Relations - Functions - Induction and Recursion - Boolean Algebra and Digital Circuits - Combinatories - Introduction to Graph Theory - Trees - Number Theory - Algorithms and Computational Complexity