Answer:
total bits = 6 + 6 + 19 = 31 bits
Explanation:
given data
total registers = 55
memory size = 64 KB
total instructions = 60
solution
here we have given 55 register so we get greater or equal power of 2 that is here 64
so here for register operand 6 bit is required
and
when instruction 60 we get here greater or equal power of 2 that is here 64
so here also for represent instruction 6 bit is required
and
for size 64 kb
= 
so 19 bits is required for memory location
and
as instruction in 2 parts are opcode and operand
and here given as 2 address instruction
they are memory operand and the register operand
so here
total bits will be = opcode + register operand + memory operand
total bits = 6 + 6 + 19 = 31 bits
total bits = 31 bits
Answer:
Explanation:
A stack item behaves like Last In First Out, which is equivalent to First In Last Out. FIFO and LILO are also equivalent, but they describe a queue.
Answer:
a. Programmed decisions
Explanation:
We basically have two types of decision:
- Programmed decision
- Non-Programmed decision
Programmed Decision: used for frequent situations of the organization; both internal and external. This decision results in the formulation of rules, procedures, and policies that can be applied in the future.
Non-Programmed Decision: used for unique and ill-structured situations of the organization; both internal and external. They are one-shot decisions. They have been handled by techniques such as judgment, intuition, and creativity.
Answer:
yes nitro hack is where they time your hacking skills
Answer:
relative cell
Explanation:
So, if you want to repeat the same calculation across several columns or rows, you need to use relative cell references. For example, to multiply numbers in column A by 5, you enter this formula in B2: =A2*5. When copied from row 2 to row 3, the formula will change to =A3
