Discrete Mathematics for Computing
Seiten
1992
Cengage Learning EMEA (Verlag)
978-0-412-45650-3 (ISBN)
Cengage Learning EMEA (Verlag)
978-0-412-45650-3 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
This text aims to cover all the needed materials for a first course in its subject, yet it assumes no prior knowledge of computing. The book is written to show how discrete mathematics relates to program design. This computer science orientation stresses the importance of logic and proof, recursion, trees, algorithm correctness and formal specifications of problems and algorithms. All algorithms are written in pseudocode to allow integration into any computer science course. The development of precise specifications for algorithms is emphasized. The text discusses why and how topics are important. More advanced materials on the importance of software verification and the use Z-notation in formal specifications are also included.
Algorithms for integers; Numbers in different bases: real numbers; Sets, functions and relations; Logic; Proof; Recursion; Analysis of algorithms; Graphs and trees; Counting; Algebraic structures; Reasoning and formal specifications.
| Erscheint lt. Verlag | 1.7.1992 |
|---|---|
| Verlagsort | London |
| Sprache | englisch |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Computerprogramme / Computeralgebra | |
| ISBN-10 | 0-412-45650-8 / 0412456508 |
| ISBN-13 | 978-0-412-45650-3 / 9780412456503 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95
