Discrete Structures with Contemporary Applications
Chapman & Hall/CRC (Verlag)
978-1-4398-1768-1 (ISBN)
A modern and comprehensive introduction to discrete structures
With clear definitions and theorems and carefully explained proofs, this classroom-tested text presents an accessible yet rigorous treatment of the material. Numerous worked-out examples illustrate key points while figures and tables help students grasp the more subtle and difficult concepts. "Exercises for the Reader" are interspersed throughout the text, with complete solutions included in an appendix. In addition to these, each section ends with extensive, carefully crafted exercise sets ranging from routine to nontrivial; answers can be found in another appendix. Most sections also contain computer exercises that guide students through the process of writing their own programs on any computing platform.
Accommodates various levels of computer implementation
Although the book highly encourages the use of computing platforms, it can be used without computers. The author explains algorithms in ordinary English and, when appropriate, in a natural and easy-to-understand pseudo code that can be readily translated into any computer language. A supporting website provides an extensive set of sample programs.
Alexander Stanoyevitch is a professor at California State University–Dominguez Hills. He completed his doctorate in mathematical analysis at the University of Michigan, Ann Arbor, and has held academic positions at the University of Hawaii and the University of Guam. Dr. Stanoyevitch has taught many upper-level classes to mathematics and computer science students, has published several articles in leading mathematical journals, and has been an invited speaker at numerous lectures and conferences in the United States, Europe, and Asia. His research interests include areas of both pure and applied mathematics.
Logic and Sets. Relations and Functions, Boolean Algebra, and Circuit Design. The Integers, Induction, and Recursion. Number Systems. Counting Techniques, Combinatorics, and Generating Functions. Discrete Probability and Simulation. Complexity of Algorithms. Graphs, Trees, and Associated Algorithms. Graph Traversal and Optimization Problems. Randomized Search and Optimization Algorithms. Appendices. References. Index.
| Erscheint lt. Verlag | 25.1.2011 |
|---|---|
| Zusatzinfo | 24 Tables, black and white; 308 Illustrations, black and white |
| Sprache | englisch |
| Maße | 178 x 254 mm |
| Gewicht | 1820 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Betriebssysteme / Server |
| Mathematik / Informatik ► Informatik ► Theorie / Studium | |
| Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 1-4398-1768-5 / 1439817685 |
| ISBN-13 | 978-1-4398-1768-1 / 9781439817681 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
