Table of contents

  1. Front Matter
    Pages i-xi
  2. G. P. McKeown, V. J. Rayward-Smith
    Pages 1-89
  3. G. P. McKeown, V. J. Rayward-Smith
    Pages 91-216
  4. G. P. McKeown, V. J. Rayward-Smith
    Pages 217-289
  5. G. P. McKeown, V. J. Rayward-Smith
    Pages 291-394
  6. Back Matter
    Pages 395-401

About this book


This text gives a clear, but rigorous description of the fundamental mathematical concepts used by computer scientists, while at the same time emphasising the need for careful justification. The authors provide proofs of all the major results; all the algorithms presented are developed carefully and their performance is analysed. Throughout, the aim is to provide a well balanced treatment of both the discrete and continuous mathematics that should be studied by the serious student of computer science. The book will therefore be most suited to those undergraduate programmes that put the emphasis on such areas as programming language semantics, program correctness, and algorithm analysis and design.


algorithms calculus computer science logic mathematics programming programming language

Authors and affiliations

  • G. P. McKeown
    • 1
  • V. J. Rayward-Smith
    • 1
  1. 1.School of Information SystemsUniversity of East AngliaNorwichUK

Bibliographic information

  • DOI
  • Copyright Information Macmillan Publishers Limited 1995
  • Publisher Name Palgrave, London
  • eBook Packages Engineering
  • Print ISBN 978-0-333-48855-3
  • Online ISBN 978-1-349-10719-3
  • Buy this book on publisher's site