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.
Answer:
earth planet rest orbit moon
Answer:
The answer is "True"
Explanation:
In computer science, the IEEE project uses this security project, it is designed for wireless network, that provides the same level security and the data encryption for cable network also.
- It provides protects in wireless transmissions from both the poking and collecting information of packets.
- It also lets hackers crack their computer, that's why the given statement is true.
Istream& operator>> (istream& input, Example& example)
{
// Extract your data from input stream here
return input;
}