Answer:
Number of fragments is 3
Explanation:
The maximum size of data field in each fragment = 4468 - 20(IP Header)
= 4448 bytes
Hence, the number of required fragment = (10000 - 20)/4448
= 3
Fragment 1
Id = 218
offset = 0
total length = 4468 bytes
flag = 1
Fragment 2
Id = 218
offset = 556
total length = 4468 bytes
flag = 1
Fragment 3
Id = 218
offset = 1112
total length = 1144 bytes
flag = 0
def pig_latin(word):
if word[0].lower() in 'aeiou':
word = word + 'way'
else:
t=''
for x in range(len(word)):
if word[x].lower() in 'aeiou':
break
if word[x].lower() == 'y' and x>0:
break
else:
t+=word[x].lower()
if word[0].isupper():
word = word[len(t):]+word[:len(t)].lower()+'ay'
word = word.title()
else:
word = word[len(t):]+word[:len(t)].lower()+'ay'
return word
word = 'test'
pl = pig_latin(word)
print(pl)
I wrote my code in python 3.8. I hope this helps.
1. spreadsheet
2. Computers will continue to become smaller in size and become faster
<span>1 X 25 + 1 X 24 + 1 X 23 + 0 X 22 + 1 X 21 + 1 X 20 thus your Answer is C</span>
Answer:
d. It is assumed that the search pool is ordered.
Explanation:
A binary search/logarithimic search/half interval search/binary chop refers to search algorithm in computer science that sorts data in array in key:value arrangements. In order to locate a value in binary search, the key to the value in a sorted array is located. A binary search is characterized by an ascending, descending order arrangement of the array.
