Mathematical Structures for Computer Science

Product Reviews

Book Description
The Prentice Hall Essence of Computing Series provides a concise, practical and uniform introduction to the core components of an undergraduate computer science degree. Acknowledging recent changes within Higher Education, this approach uses a variety of pedagogical tools-case studies, worked examples and self-test questions to underpin the student's learning.
The Mathematical Structures for Computer Science provides under one cover all the essential topics covered in a first course on Computer Science. Following an introductory chapter, which explains to the reader how to use the book, there follows chapters on sets and logic. In these chapters every effort has been made to give the reader clear instructions on how to 'calculate' values for mathematical expressions for small finite sets. Since it is best to use examples familiar to the reader, sets of numbers are used extensively. Nevertheless it is important for the reader to examine non-numerical examples, and so a case study is introduced at the end of the chapter on sets and then subsequently used throughout the remainder of the book.
Once these basic skills have been mastered, the reader progresses on to relations and functions. These are first introduced as intuitive notions before explaining how they can be modelled using sets. There follows a chapter showing how the ideas of modelling with sets and logic can be applied to more practical problems. Finally there is a brief concluding chapter which invites readers to continue their mathematical growth- The Essence of Discrete Mathematics is meant to be the beginning and not the end.
Features and Benefits

Offers a gentle introduction to discrete mathematics for those of a non-mathematical disposition.
Running case study throughout the book to help students develop and understanding of the subject.
Covers the essential components of a first level course in discrete mathematics.

Synopsis
The Prentice Hall "Essence of Computing" series provides a concise, practical and uniform introduction to the core components of an undergraduate computer science degree. Acknowledging recent changes within Higher Education, this approach uses a variety of pedagogical tools - case studies, worked examples and self-test questions - to underpin the students' learning. This book covers the essential topics of a first course on discrete mathematics. Following an introductory chapter, which explains to the reader how to use the book, there follows chapters on sets and logic. In these chapters every effort has been made to give the reader clear instructions on how to calculate values for mathematical expressions for small finite sets. Since it is best to use examples familiar to the reader, sets of numbers are used extensively. Nevertheless, it is important for the reader to examine non-numerical examples, and so a case study is introduced at the end of the chapter on sets and then subsequently used throughout the remainder of the book. Once these basic skills have been mastered, the reader progresses on to relations and functions.
[2002-12-20]