The stack grows towards lower addresses because .... the push instruction must decrement the stack pointer on most CPU architectures, thus the stack can only grow downwards the stack pointer is attracted gravitationally by the amount of bits in the heap all space between the stack pointer (top of stack) and the heap top is one single block that can be used instead of having two blocks that could cause one to be depleted before the other a process has a maximum address space limit for how many processes (among parent and all descendants created) is the following C expression NOT 0? fork() * fork() * fork() * fork() ________________