Discrete Mathematics With Algorithms
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in...
|Result Page: 34 33 32 31 30 29 28 27 26 25 |