




  Discrete Mathematics With Algorithms
This firstyear 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 problemsolving. All algorithms are presented in...   




Result Page: 34 33 32 31 30 29 28 27 26 25 