A First Course in Discrete Mathematics
This 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.
What people are saying - Write a review
The Hexadecimal System The Conversion Graph Octal
14 other sections not shown
Other editions - View all
adjacent algorithm begi binary number Boolean algebra Boolean expression Boolean function bubble sort byte called cells codomain column contains convert corresponding count the number 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 graph G Hamiltonian heap sort hexadecimal induction input insertion sort integer inverse Karnaugh map label mathematical mathematical induction matrix maximal rectangle minterm Morgan's law multiplication Note octal output pair Pascal path polynomial positive integers probability Problems and Projects procedure properties Prove quicksort random variable rational numbers real numbers represented sample space sequence shown in Figure simple events SOLUTION sort stack statement Step subsets subtract sum-of-products switch Theorem tree true truth table vector Venn diagram vertex vertices Write a program writeln x'yz yz yz yz zero