| 000 | 00993nam a2200217Ia 4500 | ||
|---|---|---|---|
| 005 | 20250730165121.0 | ||
| 008 | 250728s9999 xx 000 0 und d | ||
| 020 | _a981-4119-67-9 | ||
| 082 | _aC 511.2 W27d | ||
| 100 | _aWashburn, Sherwood | ||
| 245 | 0 | _aDiscrete Mathematics | |
| 260 | _aNew York | ||
| 260 | _b Addison Wesley Longman\ | ||
| 260 | _c2002 | ||
| 300 | _a370 p. | ||
| 300 | _bIncludes index | ||
| 520 | _aThe discrete mathematics course is looked to more and more as a resource for dealing with them. One such case: Computer science students often do not have room in their curriculum for a logic course, so the learn it in discrete math.In the discrete mathematics course, the student learns essential topics: induction and recursion, combinatorics, graph theory, and proofs and logic. Some of these topics are treated in more depth in the upper-division course. | ||
| 650 | _aDiscrete Mathematics | ||
| 700 | _aMarlowe, Thomas, Ryan,Charles T., | ||
| 942 |
_2ddc _cBK |
||
| 999 |
_c958 _d958 |
||