1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Butoxors [25]
3 years ago
11

The instruction format of a computer is given by one indirect bit, opcode bits, register address bits, immediate operand bits an

d memory address bits. It occupies one memory word of 64 bits.
a- How many memory addresses can be generated if the memory size is 1 Giga Bytes (Giga-2)? Number of addresbits Number of addresses
b- Complete the missing fields in the following instruction format, given that the number of opcodes is 128, the immediate operand field occupies 24 bits and the instruction occupies one memory word Opcode Register address Immediate operand Memory address
c- If the immediate value is increased by combining it with the address field in the above instruction. Find the largest positive and smallest negative immediate values that can be stored on the address field, before and after combining it with the address field. Range before combining (+ Range after combining-+
Computers and Technology
1 answer:
oksian1 [2.3K]3 years ago
8 0

Answer:

Following are the answer to this question:

Explanation:

A)

The memory size is 1 Giga Bytes which is equal to 2^{30}

\texttt{Number of address bits    \ \ \ \ \ \ \ \ \ \ \ \ \ \            Number of addresses}\\\\ \ \ \ \ 30  \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \                                 2^{30}= 1073741824

B) \texttt{I \ \ \ Opcode  \ \ \ Register address \ \ \  Immediate operand \ \ \    Memory address}\\\\\\\textt{1 \ bit  \  \ \ \ \ \ 128  \ \ \ \ \ \ \ \ \ \ \ \ \ \ \    2 \ bits   \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \   24 \ bits  \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  \ \ \ \ \ \ \ \ \           30 \ bits}\\\\\\            = 2^7 \\\\ = 7 \ bits

calculating the register Bits:

= 64-(1+7+24+30)\\\\=64 -62\ \  bits\\\\= 2\ \ bits\\

C)

Immediate value size while merging the additional benefit with the address field:

= 2^{24} + 2^{30}\\\\= 2^{54}\\\\\texttt{Range before combining(-,+) 24 bits   \ \ \ \ \ \       Range after combining( -,+)54bits}\\\\                         \textt{-2^{12} from + (2^{12}-1)   \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \                                    -2^{27} from + (2^{27}- 1)}

= \frac{24}{2} = 12\\\\= \frac{54}{2} = 27

The range is accomplished by dividing the bits by 2 into the two sides of the o and the number is one short to 0.

You might be interested in
Imagine your making directions easier for someone to go from any is city to another us city. Choose any 2 cities, and then Using
AnnyKZ [126]

Answer:

\huge\bold\red{Yes}

6 0
3 years ago
Harrison works in a manufacturing unit and oversees the logistics, including the daily shipping of a large number of packages. W
Nookie1986 [14]

E. Transaction processing system

Explanation:

He will need a transaction processing system to know the amount of logistics available daily and how many to ship and how many to order.

Transaction processing system will make him keep track of what transactions take place during the various days to help him give a good report.

8 0
3 years ago
Read 2 more answers
What is the name of a statement written to retrieve specific data from a table?
Shkiper50 [21]
The answer is b.record
4 0
3 years ago
George wants to edit the font of the title text in his presentation. Where can he find the option to edit it?
liberstina [14]
The answer is the answer choice D
4 0
3 years ago
Read 2 more answers
Give an efficient algorithm to find all keys in a min heap that are smaller than a provided value X. The provided value does not
viva [34]

Answer:

The algorithm to this question as follows:

Algorithm:

finding_small_element(element,Key xa) //defining method that accepts parameter

{

if (element.value>= xa) //check value

{

//skiping node

return;  

}

print(element.value);//print value

if (element.left != NULL) //check left node value

{

finding_small_element(element.left,xa); //using method

}

if (element.right != NULL) //check right node value

{

finding_small_element(element.right,xa); //using method

}

}

Explanation:

In the above pre-order traversing algorithm a method  "finding_small_element" is defined, that accepts two parameter, that is "element and ax', in which "element" is node value and ax is its "key".

  • Inside this if block is used that check element variable value is greater then equal to 0.
  • In the next step, two if block is defined, that check element left and the right value is not equal to null, if both conditions are true, it will check its right and left value. In this algorithm, there is no extra need for traversing items.
3 0
3 years ago
Other questions:
  • Which option enables you to keep the last grammatical change
    15·2 answers
  • Compare and contrast fair use to copyright.
    5·1 answer
  • Jennifer, a customer, informs you that unexpected icons are appearing on her system's desktop. You identify the symptoms of the
    12·1 answer
  • This type of software works with end users, application software, and computer hardware to handle the majority of technical deta
    12·1 answer
  • Documentation for evidence which includes exactly what, when, and from whom evidence was collected, the condition of this eviden
    6·1 answer
  • Ryan has made a presentation of ten slides, which he wants to display in sequence after a specific time interval. Which element
    5·1 answer
  • 4. What are the things that a computer literate understands?name them
    5·2 answers
  • can you follow my ikok? its that_enby_skye and my youube Cactus Face with 241 subscribe er s & my twith Mx_Skye
    10·2 answers
  • Today's consoles and games have audio features that rival cinematic audio.<br> True or False?
    6·2 answers
  • If the cpu is fast but the bus speed is slow, that condition is called?
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!