Some disadvantages of taking part in a video-conference are:
1) Lack of communication from social cues (social cues are what we use to see if someone is in a good or bad mood)
2) There is a high chance of unstable network connection.
3) Technical and personal issues because not everyone is comfortable speaking on a video-conference platform.
4) It causes more stress due to the lack of organization when preparing meetings (because it’s so easy to just get on a device without preparing anything beforehand).
Hope this helped!
Answer: (C) to reduce or eliminate future bank panics.
Explanation:
The Federal Reserve System being the central reserve system in the US was created with the primary objective of reducing and eliminating bank panics in periods of recessions and depressions and other bank related matters.
Answer: .com — Commercial businesses.
.org — Organizations (generally charitable).
.net — Network organizations.
.gov — U.S. government agencies.
.mil — Military.
.edu — Educational facilities, like universities.
Explanation:
Answer:
a blog
Explanation:
a forum is for questions, a wiki doesn't make sense in this situation and email wouldn't be used for this either so it should be a blog
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.
