In the past few posts, we have considered that programs can be composed of smaller parts. The ability to reduce a program to a collection of smaller, connected algorithms is known as modularity.
When we consider a set of modules (smaller algorithms which are connected to form a program), we can consider a measure of
As we learned earlier, programs are broken into assembly instructions, which are executed one-at-a-time. The question which naturally arises is what constitutes an instruction, and how many instructions we actually need.
There are two major categories of instruction sets:
The Reduced Instruction Set Computer (RISC) has a very small set of very basic instructions. These instructions