Answer:
yes i agree with that the answer is in fact true
Explanation:
follow my in sta gram at grac.ehihi
Answer:
<u>Advantages of wireless communication:-</u>
- Flexibility in transferring the message through communication for which the sender and receiver can be in any place.
- Speed of the communication is accurate and fast
- Due to no wiring , the cost of the wireless communication is less.
<u>Disadvantages of wireless communication:-</u>
- The security is less as the data can be accessed by unauthorized sources at times.
- The setting up of wireless communication complex and expensive.
<u>Advantages of wired communication:-</u>
- Simple configuration
- Higher bandwidth is present in the cable
- High reliability
<u>Disadvantages of wired communication:-</u>
- Mobility is present for communication
- Installation requires lot of time due to cabling
- Requires extra devices for covering large areas for communication
Wireless communication is more preferable than wired communication in the conditions like communication connection that should face low damage and longer life which is not present in cable connection as they break or get disrupted.The flexibility of moving while communication is required by most people so, they use wireless communication .
Answer:
C: The protocols of the Internet are open and used by all devices connected to the network
Explanation: Hope this helps.
There are billions of devices connected to the Internet, and hundreds of different kinds of devices: laptops, tablets, phones, refrigerators, handheld credit card readers, and so on. Protocols (standards) ensure that the variety of devices interact with each other smoothly. There are a lot of protocols! The Internet was designed with several layers of abstraction that sort the protocols according to what part of the process they support.
Big-O notation is a way to describe a function that represents the n amount of times a program/function needs to be executed.
(I'm assuming that := is a typo and you mean just =, by the way)
In your case, you have two loops, nested within each other, and both loop to n (inclusive, meaning, that you loop for when i or j is equal to n), and both loops iterate by 1 each loop.
This means that both loops will therefore execute an n amount of times. Now, if the loops were NOT nested, our big-O would be O(2n), because 2 loops would run an n amount of times.
HOWEVER, since the j-loop is nested within i-loop, the j-loop executes every time the i-loop <span>ITERATES.
</span>
As previously mentioned, for every i-loop, there would be an n amount of executions. So if the i-loop is called an n amount of times by the j loop (which executes n times), the big-O notation would be O(n*n), or O(n^2).
(tl;dr) In basic, it is O(n^2) because the loops are nested, meaning that the i-loop would be called n times, and for each iteration, it would call the j-loop n times, resulting in n*n runs.
A way to verify this is to write and test program the above. I sometimes find it easier to wrap my head around concepts after testing them myself.
Answer:
what are the followin six terms
Explanation:
