A First Course in Discrete MathematicsThis highly regarded work fills the need for a treatment of elementary discrete mathematics that provides a core of mathematical terminology and concepts as well as emphasizes computer applications. Includes numerous elementary applications to computing and examples with solutions. |
Contents
PREFACE | 1 |
The Hexadecimal System The Conversion Graph Octal | 16 |
Divisibility Congruences Solving Linear | 36 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
A₁ adjacent algorithm begin binary number Boolean algebra Boolean expression Boolean function bubble sort byte called cells codomain column contains convert corresponding decimal defined denoted digits digraph distribution domain edges entry equation equivalent Eulerian EXAMPLE exercise exponent F F F F T F Find floating-point floating-point numbers Formula function Hamiltonian heap sort hexadecimal induction input integer inverse Karnaugh map mathematical induction matrix maximal rectangle minterm Morgan's law multiplication Note octal output pair Pascal polynomial positive integers probability Problems and Projects procedure properties Prove quicksort r₁ random variable rational numbers real numbers sample space sequence shown in Figure simple events SOLUTION sort sorting algorithms stack statement Step subsets subtract sum-of-products sum-of-products form switch Theorem tree true truth table vector Venn diagram vertex vertices Write a program writeln('input x'yz zero