Answer: Hello your required question is wrong as it does not tally with the data provided , attached below is the complete question
answer:
/23 /26 /27 /28 option A
Explanation:
<u>Breakdown of the last four subnet masks given to the subnets </u>
For the subnet of 500 production host the mask = /23 which will produce 512 hosts
For the subnet of 60 sales host the mask = /26 which will produce 64 hosts
For the subnet of 12 host the mask = /27 which will produce 32 hosts
For the subnet of 30 hosts the mask = /28 which will produce 16 hosts
Answer:
(a) yes, this protocol allows only serializable schedules for transactions as due to this the system maintains it's consistency. As in this protocol a unique transaction id is being assigned and with the help of that transaction id the system would be able to identify the process which has taken place in what particular order. For example, in case of bank transfers
balance = 1000 transaction id 100
write ADD 200 transaction id 101
write SUB 1100 transaction id 102
write ADD 900 transaction id 103
in here with the help of transaction id we can check which operation has happened in which order, if not then some operation will not happen like 102 immediately after 100 and skipping 101
(b) the modified version of this protocol would be to also consider the time of transaction and take this factor in the consideration
Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
