| Richard Johnsonbaugh - Mathematics - 1986 - 480 pages
This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has ... | |
| James L. Hein - Computers - 2003 - 731 pages
Hein (Portland State U.) offers an introductory textbook that aims to give the reader a holistic understanding of discrete mathematics and computer science, through careful ... | |
| Rajendra Akerkar, Rupali Akerkar - 332 pages
Discrete Mathematics provides an introduction to some of the fundamental concepts in modern mathematics. Abundant examples help explain the principles and practices of discrete ... | |
| Computers - 1997 - 580 pages
The strong algorithmic emphasis of "Discrete Mathematics" is independent of a specific programming language, allowing students to concentrate on foundational problem-solving ... | |
| |