search
Log In
0 votes
273 views

How will this question be solved?

in CO and Architecture
edited by
273 views
0
32 - (3+6+18) = 5 bits, 32 different instructions are possible..
0
answer they have given to be 2^3=8. Even i got 2^5 = 32.
0

is this a correct solution ... i just doubt.

2
this is correct, because it's given that memory is byte addressable. hence, number of bits for accessing a memory address would be 20 instead of 18.
0
got it thanks.

2 Answers

2 votes
Total Memory = 2 ^ 18 * 32 bits =>2 ^(18+5)=2^23 bits => 2^23/2^3 B ( given byte addressable) =>2^20 B

Address length for Memory =20 bits

Mode = log 7= 3 bits

Registers= log 60 =6 bits

Opcode=32-(3+6+20)=> 32-29 =>3  

So no of instructions = 2^3 = 8 diff instructions are possible
0
got it thanks.
0 votes

8 instn is possible

0

 Can you provide a source to learn this as I'm not able to solve these type of questions.

Related questions

2 votes
2 answers
2
1.1k views
The format of a double operand instruction of a CPU consist of 4 bit op-code and 4 bits for source and destination. 12 double operand instructions and 24 single operand instructions must be implemented. Op-code field must identify the three groups of n-operand instructions. Calculate the total number of zero operand instructions that can be implemented?
asked Jan 21, 2016 in CO and Architecture khushtak 1.1k views
0 votes
1 answer
4
377 views
In an 16 bit instruction the size of address field is 7 bits. The computer uses expanding opcode technique.It has 2, two address instructions and 250 one address instruction. How many Zero address instructions can be formulated ? 5120 15304 768 1024 0
asked Jan 16, 2019 in CO and Architecture Na462 377 views
...