| 000 | 01212nam a2200217Ia 4500 | ||
|---|---|---|---|
| 005 | 20250730165120.0 | ||
| 008 | 250728s9999 xx 000 0 und d | ||
| 020 | _a978-981-4232-92-0 | ||
| 082 | _aC 511.2 H12d | ||
| 100 | _aHaggard, Gary | ||
| 245 | 0 | _aDiscrete mathematics for engineers and scientist | |
| 260 | _aSingapore | ||
| 260 | _b Thomson Brooks/Cole | ||
| 260 | _c2008 | ||
| 300 | _axxiii, 600 p. | ||
| 300 | _bIncludes index | ||
| 520 | _aDiscrete mathematical topics is an essential part of the computer science major. The course in discrete structures has two primary aims. The first is to introduce students to the rich mathematical structures that naturally describe much of the content of the computer science discipline, including many structures that are frequently used in modeling and implementing solutions to problems. The second is to help students develop the skills of mathematical reasoning to learn new concepts and material in computer science. This learning takes place not only while they are students but also after graduation and throughout their professional life. | ||
| 650 | _aDiscrete Mathematics | ||
| 700 | _aSchlipf, John ; Whitesides, Sue, | ||
| 942 |
_2ddc _cBK |
||
| 999 |
_c948 _d948 |
||