Answer:
you can look it up if you want to just look up modern technological machine and u will get it.
Option D is the answer.
Option A is rejected because in centralized communication notwork there is no free flow of communication in all directions ( all direction means between all the groups or layers of the network).
Option B is not the answer because centralized and decentralized networks has nothing to do with the size of organizations.
Option C is rejected because decision making process depends on the hard work and technical skills of groups of an organization about a field but not by the network discipline.
Option D is selected because in centralized network the information or decision making power is primarily limited to the upper level or higher members of organization and as mentioned decentralized decides on the basis of decision of all the groups or levels of the network.
Answer:
Following are the responses to the given question:
Explanation:
Its machine slows for each further level of evaluation by an n/m factor. Therefore are the times for implementation for levels 2, 3, and 4 are 
.
So, the level values are:
Answer:
The term “core hardware “ is merely a reference to the minimum physical hardware requirements for a given application to run to benchmarks established by the programmers.. DISTRIBUTION HARDWARE.. Electrical Distribution Hardware for the Energy Industry
Answer: provided in the explanation segment
Explanation:
taking a step by step process for this, we will analyze this problem,
we have that the Word size = 8 bytes
Cache size = 128 KB = 128×2¹⁰ bytes = 2¹⁷ bytes
(a). we are asked to cal for fully associative mapping with line size of 4 words.
- fully associative mapping with line size of 4 words = 4 × 8 = 32 bytes
- offset = log₂³² = 5 bit
- tag = 32 - (5+0) = 27 bit
- index bit = 0
(b). Direct mapping with the line size of 8 words:
- here the line size = 8×8 = 64 bytes
- no of lines = 2¹⁷/2⁶ = 2¹¹ lines
- offset = log ₂(2⁶) = 6 bit
- index = log ₂(2¹¹) = 11 bit
- tag = 32 - (5 +11) = 15 bit
(c). 2-way set associated mapping with the line size of 1 word:
- no of lines = 2¹⁷/2³ = 2¹⁴ lines
- offset = log₂(2³) = 3 bit
- no of sets = 2¹⁴/2 = 2¹³ sets
- index = log₂(2¹³) = 13 bit
- tag = 32 - (3+13) = 16 bit
(d). 8-way set associated mapping with the line size of 2 words:
8-way set associated mapping with the line size of 2 = 2*8 = 16 bytes
- no of lines = 2¹⁷/2⁴ = 2¹³ lines
- no of sets = 2¹³/2³ = 2¹⁰ sets
- offset = log₂¹⁶ = 4 bit
- index = log ₂(2¹⁰) = 10 bit
- tag = 32 - (4+10) = 18 bit
cheers i hope this helps!!!!
