How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine (A ∗ B) + (C ∗ D / E)?
A byte addressable computer has a memory capacity of 2m KB( kbytes ) and can perform 2m operations. An instruction involving 3 operands and one operator needs maximum of