|
|
|
|
|
by vecter
5829 days ago
|
|
I'm not sure whether one can say that EE is harder than CS, or vice versa. For starters, which subfields of EE and CS are you comparing? If, for CS, you pick Theory of Computation, Algorithms, or Machine Learning, then those are pretty difficult fields. If you pick programming languages, databases, or user interface design, those are "easier" than the aforementioned (although still challenging in their own right). In EE, if you pick some of thee classes that Stephen Boyd [http://www.stanford.edu/~boyd/] teaches at Stanford, I would imagine those are difficult. How much more difficult is convex optimization than complexity theory? I'm not sure, but I don't think one's necessarily easier than the other. |
|
I think what makes CS more tractable is that the theory is easily testable and you can write a program and see things work. Many times when you're working with signals and antennas all you have is the theory and there's very little you can do to visualize what's actually going on, not to mention working in the analog domain always throws you some surprises.
Never in CS will you hear "Well that's due to relativistic effects."
Additionally there's the practical problem in EE that you rarely encounter in CS of actually building physical things. How many times has a program given you bad results because someone somewhere turned on the microwave? :-)