Discrete Mathematics for ComputingThis text is suitable for an introductory course in the mathematics related to computing, generally referred to as discrete mathematics. Topics covered include set theory, logic, and methods of proof, graphs, digraphs and trees, number systems and matrix algebra, and an introduction to binary codes. Throughout the book, the interrelations between the mathematical structures and their representations is stressed, and use is made of 'action diagrams' as a language-independent means of presenting algorithmic processes. Readers who work through this text will acquire the mathematical knowledge and approach to problem solving required by introductory computing courses, and a sound bases from which to pursue the subject further. |
Contents
Table of contents Preface | 7 |
Introduction to discrete mathematics | 9 |
Sets and set algebra | 25 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
action diagram algebra algorithm answer apply arithmetic binary positional tree bipartite graph Boolean bracket Bridgend calculate Cartesian product Chapter column complete graph connected contain corresponding defined denote digits digraph directed graph discrete mathematics doubly linked list edges elements encoding ENDIF entries equation equivalence relation error evaluate example Exercise expression give given idea integer isomorphic linked list logical look mathematics matrix multiplication means message word method minimum n-tuple notation number of possible odd number operations ordered pairs ordered tree output parity bits path permanent label pointer Prim's algorithm probability problem produce proof properties R₁ received word relation represent representation result selection sequence set theory shown in Fig simple spanning tree statement structure subgraph subset Suppose temporary label true truth table valid codeword vertices weight write zero