DISCRETE MATHEMATICS FOR COMPUTER SCIENTISTS
Tahun : 2010Pengarang : Clifford Stein. Robert L. Drysdale.Kenneth Bogart
Penerbit : addison wesley
Ket : Inductive proofs in computer science frequently use subproblems that are not “one smaller.” We therefore emphasize strong induction as well as weak induction. We also introduce structural induction on trees and graphs.We try to use students’ experiences with recursion to help them understand induction and develop inductive proofs. In particular, when creating an inductive proof it is usually more profitable to start with a big problem and recursively subdivide it into smaller problems than to start with small problems and try to “build up” to bigger problems.
Ketegori : DISCRETE MATHEMATICS
