Answer:
<em>=</em><em>></em><em>. </em><em>storage</em><em> </em><em>devices</em><em> </em><em>are</em><em> </em><em>those</em><em> </em><em>devices</em><em> </em><em>that </em><em>is </em><em> </em><em>used </em><em>to </em><em>store</em><em> </em><em>some </em><em>data </em><em>in </em><em>it </em>
<em>It </em><em>is </em><em>very </em><em>important</em><em> </em><em>device</em><em> </em><em>that </em><em>gives </em><em>a </em><em>lot </em><em>of </em><em>benefits</em><em> </em><em>in </em><em>our </em><em>daily</em><em> lives</em>
<em>we </em><em>can </em><em>also </em><em>carry</em><em> </em><em>our </em><em>data </em><em>from </em><em>one </em><em>place</em><em> to</em><em> </em><em>another</em>
Answer:
The answer is "private Ip addresses were not be accessed over the Network".
Explanation:
Private network addresses were not distributed on the web and also no data from either the network will be sent to them, it only was intended to operate inside of the home network.
- It includes the appropriate subnet the IP addresses. This network also enables you to link to many other sites.
- This network will use its IP address to access the home device, but it can not interact with the network.
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
