Answer:
Relational Databases
Explanation:
These are digital databases that are made to recognize relations between previously stored items of info.
Using a linear search to find a value that is stored in the last element of an array of 20,000 elements, 20,000 element(s) must be compared.
<span>If you want to add a border you have to use 'Insert' tab to make this change. Then you have to click on</span> "Picture" that is placed in the Insert menu, and choose "Clip Art." You can use the search box at the top of the Clip Art gallery in order to find a suitable border. When you finally found it, click on it, then select the button "Insert".
Explanation:
Let, DG is the datagram so, DG= 2400.
Let, FV is the Value of Fragment and F is the Flag and FO is the Fragmentation Offset.
Let, M is the MTU so, M=700.
Let, IP is the IP header so, IP= 20.
Let, id is the identification number so, id=422
Required numbers of the fragment = ![[\frac{DG-IP}{M-IP} ]](https://tex.z-dn.net/?f=%5B%5Cfrac%7BDG-IP%7D%7BM-IP%7D%20%5D)
Insert values in the formula = ![[\frac{2400-20}{700-20} ]](https://tex.z-dn.net/?f=%5B%5Cfrac%7B2400-20%7D%7B700-20%7D%20%5D)
Then, =
= ![[3.5]](https://tex.z-dn.net/?f=%5B3.5%5D)
The generated numbers of the fragment is 4
- If FV = 1 then, bytes in data field of DG=
and id=422 and FO=0 and F=1.
- If FV = 2 then, bytes in data field of DG=
and id=422 and FO=85
and F=1.
- If FV = 3 then, bytes in data field of DG=
and id=422 and FO=170
and F=1.
- If FV = 4 then, bytes in data field of DG=
and id=422 and FO=255
and F=0.