Answer:
:)
Explanation:
Copyright Designs and Patents Act
The Copyright Designs and Patents Act (1988) gives creators of digital media the rights to control how their work is used and distributed. ...
Anything which you design or code is automatically copyrighted and may not be copied without your permission, as the digital creator.
Answer:
The answer is "For the stop and wait the value of S and R is equal to 1".
Explanation:
- As we know that, the SR protocol is also known as the automatic repeat request (ARQ), this process allows the sender to sends a series of frames with window size, without waiting for the particular ACK of the recipient including with Go-Back-N ARQ.
- This process is mainly used in the data link layer, which uses the sliding window method for the reliable provisioning of data frames, that's why for the SR protocol the value of S =R and S> 1.
Answer:
loop
Explanation:
Loop is the one which is used to execute the specific statement again and again until the condition is true.
In the programming, there are 3 basic loop used.
1. for loop
<u>Syntax:</u>
for(initialization, condition, increment/decrement)
{
statement;
}
the above statement execute until the condition in the for loop true when it goes to false, the loop will terminate.
2. while loop
<u>Syntax:</u>
initialization;
while(condition)
{
statement;
increment/decrement;
}
it is work same as for loop and the increment/decrement can be write after or before the statement.
3. do while
syntax:
initialization;
do
{
statement;
increment/decrement;
}while(condition);
here, the statement execute first then, it check the condition is true or not.
so, if the condition is false it execute the statement one time. this is different with other loops.
Answer:
Check the explanation
Explanation:
1.
System = 256Byte = 8 bit
Cache = 64B , block size = 16 byte.
A) Direct Mapped Cache:
Block offset = log (Block size) = log 16 = 4bit
Total # of block inside cache = 4.
Therefore index offset = log 4 = 2bit.
Remaining is tag bits.
Therefore tag bits = 8-(4+2) = 8-6 = 2 bits
Tag Index offset Block offset
(2 bits) (2 bits) (4 bits)
Fully associative cache :
In fully associative cache, any of main memory block can be placed anywhere in cache. Therefore index offset =0 bits.
Therefore tag bits = 8-block offset bit= 8-4 =4bits
Tag Block offset
(4 bits) (4 bits)
