Discrete Structures with Contemporary Applications

Alexander Stanoyevitch

ISBN 10: 1439817685 / ISBN 13: 9781439817681

Editore: CRC Press Jan 2011, 2011

Riguardo questo articolo

Neuware - Reflecting many of the recent advances and trends in this area, this classroom-tested text covers the core topics in discrete structures as outlined by the ACM and explores an assortment of novel applications, including simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory. It presents algorithms in pseudo code and offers sample programs via the author's website. The text also includes a wide variety of examples and exercises, with solutions in the appendices. In addition, computer exercises teach students how to write their own programs. A solutions manual is available upon qualifying course adoption.

Codice articolo 9781439817681

Dati bibliografici

• Titolo: Discrete Structures with Contemporary Applications
• Editore: CRC Press Jan 2011
• Data di pubblicazione: 2011
• Lingua: Inglese
• ISBN 10: 1439817685
• ISBN 13: 9781439817681
• Rilegatura: Buch
• Condizione: Neu
• Dimensioni: 257 L x 178 A x 51 P (millimetri) 257 millimetri di larghezza per 178 millimetri di altezza per 51 millimetri di profondità
• Peso: 1905 grammi

Descrizione articolo

Riassunto

Reflecting many of the recent advances and trends in this area, Discrete Structures with Contemporary Applications covers the core topics in discrete structures as well as an assortment of novel applications-oriented topics. The applications described include simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory.

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.

Informazioni sull?autore

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.