# Lectures on Discrete Mathematics for Computer Science

US$69.00

Free delivery worldwide

Available

Dispatched from the UK in 2 business days

## Description

This textbook presents all the fundamental topics of discrete mathematics that are introduced from the perspectives of a pure mathematician and an applied computer scientist. The integration of the two perspectives is seen throughout the book; key concepts are motivated and explained through real-world examples, and yet are still formalized with mathematical rigor. Thus, it is an excellent introduction to computer science and software engineering. The first author is a leading mathematician in the area of logic, computability, and theoretical computer science, with more than 25 years of teaching and research experience. The second author is a computer science PhD student at the University of Washington specializing in database systems. The father-and-daughter team bring together two different perspectives to create a unified book for students interested in learning discrete mathematics, connections between discrete mathematics and computer science, and the mathematical foundations of computer science. Readers will learn how to formally define abstract concepts, reason about objects (e.g., programs, graphs and numbers), investigate properties of algorithms, and prove their correctness. The textbook concentrates on the study of several well-known algorithmic problems (e.g., the path problem for graphs and finding the greatest common divisor), inductive definitions, proofs of correctness of algorithms via loop invariants and induction, the basics of formal methods (e.g., propositional logic), finite state machines, counting, probability, and the foundations of databases (e.g., relational calculus).

show more## Product details

- Hardback | 300 pages
- 154 x 228 x 26mm | 639.56g
- 22 Mar 2012
- World Scientific Publishing Co Pte Ltd
- Singapore, Singapore
- English
- black & white illustrations
- 9814340502
- 9789814340502
- 612,830

## People who bought this also bought

### An Elementary Introduction to the Wolfram Language

14 Jan 2016

Paperback

US$18.59 US$19.95

Save US$1.36

### Schaum's Outline of Essential Computer Mathematics

01 May 1982

Hardback

US$17.47 US$25.00

Save US$7.53

## Other books in Discrete Mathematics

### Schaum's Outline of Essential Computer Mathematics

01 May 1982

Hardback

US$17.47 US$25.00

Save US$7.53

### Concepts and Applications of Finite Element Analysis

31 Oct 2001

Hardback

US$223.10 US$241.95

Save US$18.85

### An Elementary Introduction to the Wolfram Language

14 Jan 2016

Paperback

US$18.59 US$19.95

Save US$1.36

## Other books in this series

## Flap copy

This textbook presents all the fundamental topics of discrete mathematics that are introduced from the perspectives of a pure mathematician and an applied computer scientist. The integration of the two perspectives is seen throughout the book; key concepts are motivated and explained through real-world examples, and yet are still formalized with mathematical rigor. Thus, it is an excellent introduction to computer science and software engineering. The first author is a leading mathematician in the area of logic, computability, and theoretical computer science, with more than 25 years of teaching and research experience. The second author is a computer science PhD student at the University of Washington specializing in database systems. The father-and-daughter team bring together two different perspectives to create a unified book for students interested in learning discrete mathematics, connections between discrete mathematics and computer science, and the mathematical foundations of computer science. Readers will learn how to formally define abstract concepts, reason about objects (e.g., programs, graphs and numbers), investigate properties of algorithms, and prove their correctness. The textbook concentrates on the study of several well-known algorithmic problems (e.g., the path problem for graphs and finding the greatest common divisor), inductive definitions, proofs of correctness of algorithms via loop invariants and induction, the basics of formal methods (e.g., propositional logic), finite state machines, counting, probability, and the foundations of databases (e.g., relational calculus).

show more## Table of contents

Definitions, Theorems, and Proofs; Arithmetic; Graphs; Circuits; Trees; Basics of Sets; Relations and Databases; Induction; Reachability Games on Graphs; Functions and Transitions; Propositional Logic; Finite Automata; Regular Expressions; Counting; Probability.

show more