Answer:
Time Complexity of Problem - O(n)
Explanation:
When n= 1024 time taken is t. on a particular computer.
When computer is 8 times faster in same time t , n can be equal to 8192. It means on increasing processing speed input grows linearly.
When computer is 8 times slow then with same time t , n will be 128 which is (1/8)th time 1024.
It means with increase in processing speed by x factor time taken will decrease by (1/x) factor. Or input size can be increased by x times. This signifies that time taken by program grows linearly with input size n. Therefore time complexity of problem will be O(n).
If we double the speed of original machine then we can solve problems of size 2n in time t.
Te ajut eu daca vrei tu la refera
Answer:
In a STAR TOPOLOGY network, each device on the network is attached to a central router. If the router fails, then the other devices will be unable to communicate, but if only one connected device fails, then all other devices will still be able to communicate.
Explanation:
In this type of topology all the computers are connected to a single router through a cable. This router is the central node and all others nodes are connected to the central node.
Answer:
Interference.
Explanation:
As the user is communicating with their friend through the mobile, most of their interaction is interrupted by the noise of an airplane flying at low hight. Instantly afterward, the user's mobile phone rang, disrupting the communication once more.
So, according to the following scenario both of those are examples of interference.
Answer:
I am going to use the Python programming language to answer this. The source code is given below:
print("Enter your tweet here")
user_tweet = input()
decoded_tweet = user_tweet.replace('TTYL', 'talk to you later')
print("This is the decoded tweet: ")
print(decoded_tweet)
Explanation:
In the program the replace() module was used to replace 'TTYL' with 'talk to you later.'
Attached is the screenshot of the output.
