155,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
payback
78 °P sammeln
  • Gebundenes Buch

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…mehr

Produktbeschreibung
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.
Autorenporträt
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.