||Since O(N) does not imply performing exactly N operations, the table in the tutorial is very vague. It probably describes the running time of "light" algorithms, i.e. those with low hidden constant. In general, you can't derive the runtime from just algorithm's complexity and processor's speed.
You can interpret this table as the runtime for algorithms with hidden constant equal to 1 and processor performing 10^8 operations per second (note that yet again it depends on the type of operations, but let's keep it simple), or for algorithms with hidden constant equal to 10 and processor performing 10^9 operations per second.