Texts in Computer Science

This engaging and clearly written textbook/reference provides a must-have introduction to the rapidly emerging interdisciplinary field of data science. It focuses on the principles fundamental to beco

This textbook provides a comprehensive and reader-friendly introduction to the field of computational social science (CSS). Presenting a unified treatment, the text examines in detail the four key met

There are many kinds of books on formal logic. Some have philosophers as their intended audience, some mathematicians, some computer scien- tists. Although there is a common core to all such books, th

A new advanced textbook/reference providing a comprehensive survey of hardware and software architectural principles and methods of computer systems organization and design. The book is suitable for a

Now in a second, expanded edition, this book bridges the gap between standard geometry books, which are primarily theoretical, and applied books on computer graphics and introduces a range of geometri

This book presents a broad overview of computer graphics (CG), its history, and the hardware tools it employs. Covering a substantial number of concepts and algorithms, the text describes the techniqu

A dual purpose textbook. It is uniquely written to cover core material in the foundations of computing for graduate students in computer science and to provide an introduction to some more advanced to

Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of s

Image processing is concerned with the analysis and manipulation of images by computer. Providing a thorough treatment of image processing with an emphasis on those aspects most used in computer graph

Much current research in computer science is concerned with two questions: is a program correct? And how can we improve a correct program preserving correctness? This latter question is known as the r

Category theory has become increasingly important and popular in computer science, and many universities now have introductions to category theory as part of their courses for undergraduate computer scientists. The author is a respected category theorist and has based this textbook on a course given over the last few years at the University of Sydney. The theory is developed in a straightforward way, and is enriched with many examples from computer science. Thus this book meets the needs of undergradute computer scientists, and yet retains a level of mathematical correctness that will broaden its appeal to include students of mathematics new to category theory.

This textbook is designed as a first book on concurrent programming for computer science undergraduates, and provides a comprehensive introduction to the problems of concurrency. Concurrency is of vital importance in many areas of computer science, particularly in operating systems. It is also increasingly being taught in undergraduate courses. The book builds on the student's familiarity with sequential programming in a high level language, which will make it very accessible to computer science students. The book is concerned mainly with the high level aspects of concurrency, which will be equally applicable to traditional time sliced or more recent truly parallel systems.

Computing is an exact science and the systematic study of any aspect necessarily involves the use of mathematical models. Moreover, the rate at which the subject is evolving demands a facility for developing new mathematical systems to keep pace with new computing systems and this requires an appreciation of how mathematics works. An understanding of the underlying mathematical structure facilitates the construction of suitable computer programs to perform computations. Assuming no specific knowledge of mathematics, the authors describe all the basic concepts required and progress from sets (rather than numbers) through a variety of algebraic structures that permit the precise description, specification and subsequent analysis of many problems in computing. The material included provides the essential mathematical foundations for core topics of computer science and extends into the areas of language theory, abstract machine theory and computer geometry. Computer Mathematics will be of

This updated textbook introduces readers to assembly and its evolving role in computer programming and design. The author concentrates the revised edition on protected-mode Pentium programming, MIPS a

This successful textbook on predictive text mining offers a unified perspective on a rapidly evolving field, integrating topics spanning the varied disciplines of data science, machine learning, datab

Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in

For the Introduction to Computer Science course. A broad exploration of computer science–with the depth needed to understand concepts Computer Science: An Overview provides a bottom

This textbook is an introduction to denotational semantics and its applications to programming languages. Dr Allison emphasizes a practical approach and the student is encouraged to write and test denotational definitions. The first section is devoted to the mathematical foundations of the subject and sufficient detail is given to illustrate the fundamental problems. The remainder of the book covers the use of denotational semantics to describe sequential programming languages such as Algol, Pascal and C. Throughout, numerous exercises, usually in Pascal, will help the student practise writing definitions and carry out simple applications. The book culminates in discussing an executable semantics of the logic-programming language Prolog. Being an introduction, advanced undergraduates in computer science and graduates new to the subject will find this a readily accessible account of one of the central topics of computer science.

By the time students have done some programming in one or two languages and have learnt the common ways of representing information in a computer, they will want to embark upon further study of theoretical or applied topics in computer science. Most will encounter problems that require for their solution one or more of the techniques described in this book: for example problems depending upon the formation and solution of different equations; the task of making lists of possible alternatives and of answering questions about them; or the search for discrete optima. Written by the same authors as the highly successful Information Representation and Manipulation in a Computer, this book describes algorithms of mathematical methods and illustrates their application with examples. The mathematical background needed is elementary algebra and calculus. Numerous exercises are provided, with hints to their solutions.

This lively introduction to computer science and computer programming in Scheme is for non-computer science majors with a strong interest in the subject and for computer science majors who lack prior