(I’ve always thought that the math behind computer programming was damn useful stuff, but the engineering students I’ve talked with usually find it harder than calculus, so maybe that’s not the best idea.)
Tangential question to your tangential question: I’m puzzled, which math are you talking about here? The only math relevant to programming that I can think of that engineering students would also learn would be discrete math, but the extent needed for good programming competency is pretty small and easy to pick up.
Are we talking numerical computing instead, with optimization problems and approximating solutions to DE’s? That’s the only thing I can think of relevant to engineering for which the math background might be more difficult than calculus.
I was thinking more basic: induction, recursion, reasoning about trees. Understanding those things on an intuitive level is one of the main barriers that people face when they learn to program. It’s one thing to be able to solve problems out of a textbook involving induction or recursion, but another thing to learn them so well that they become obvious—and it’s that higher level of understanding that’s important if you want to actually use these concepts.
I’m not sure about all the details, but I believe that there was a small kerfuffle a few decades ago over a suggestion to change the apex of U.S. ``school mathematics″ from calculus to a sort of discrete math for programming course. I cannot remember what sort of topics were suggested though. I do remember having the impression that the debate was won by the pro-calculus camp fairly decisively—of course, we all see that school mathematics hasn’t changed much.
Tangential question to your tangential question: I’m puzzled, which math are you talking about here? The only math relevant to programming that I can think of that engineering students would also learn would be discrete math, but the extent needed for good programming competency is pretty small and easy to pick up.
Are we talking numerical computing instead, with optimization problems and approximating solutions to DE’s? That’s the only thing I can think of relevant to engineering for which the math background might be more difficult than calculus.
I was thinking more basic: induction, recursion, reasoning about trees. Understanding those things on an intuitive level is one of the main barriers that people face when they learn to program. It’s one thing to be able to solve problems out of a textbook involving induction or recursion, but another thing to learn them so well that they become obvious—and it’s that higher level of understanding that’s important if you want to actually use these concepts.
I’m not sure about all the details, but I believe that there was a small kerfuffle a few decades ago over a suggestion to change the apex of U.S. ``school mathematics″ from calculus to a sort of discrete math for programming course. I cannot remember what sort of topics were suggested though. I do remember having the impression that the debate was won by the pro-calculus camp fairly decisively—of course, we all see that school mathematics hasn’t changed much.