Those are actually good ideas, and if you received a computer science degree from Carnegie Mellon University, you may have witnessed first hand their actualizat

Those are actually good ideas, and if you received a computer science degree from Carnegie Mellon University, you may have witnessed first hand their actualization in CS 213, Introduction to Computer Systems: http://www.cs.cmu.edu/afs/cs/academic/class/15213-f01/www/ http://www.cs.cmu.edu/afs/cs/academic/class/15213-f01/www/ From the syllabus: 1. Int’s are not integers, Float’s are not reals. Our finite representations of numbers have significant limitations, and because of these limitations we sometimes have to think in terms of bit-level representations. 2. You’ve got to know assembly language. Even if you never write programs in assembly, The behavior of a program cannot be understood sometimes purely based on the abstraction of a high-level language. Further, understanding the effects of bugs requires familiarity with the machine-level model. 3. Memory matters. Computer memory is not unbounded. It must be allocated and managed. Memory referencing errors are especially pernicious. An erroneous updating of one object can cause a change in some logically unrelated object. Also, the combination of caching and virtual memory provides the functionality of a uniform unbounded address space, but not the performance. 4. There is more to performance than asymptotic complexity. Constant factors also matter. There are systematic ways to evaluate and improve program performance 5. Computers do more than execute instructions. They also need to get data in and out and they interact with other systems over networks.