Answer: Procedural software
Explanation:
Procedural software programming is the programming mechanism that functions through splitting the data and functions of the program.This programming focuses on subroutines or action for functioning as per call of procedure.
- It can carry out computation through steps in linear manner or top-to-bottom manner.
- These steps consist of data ,subroutines, routines and other variable and functions for working.
Answer:
Zohar abides by his school’s Internet policy and does not visit questionable websites.
Explanation:
Only the first one is ethical behavior. The second choice is an example of plagiarism. The third & fourth choices could be examples of cyberbullying.
Most likely a virus has attacked the system and is disabling encryption is the most likely problem.
c. Most likely a virus has attacked the system and is disabling encryption.
<u>Explanation:</u>
The end users can protect the folder by enabling encrypt the folder or files. But in windows encrypting the file or folder is not available. The computer management console is used to open all other services such as risk management, performance management extra.
In some other operating encryption of folder or files is allowed. Third-party software is available to protect folder or files once the third party used any files possible to share outside the world.
As far as my knowledge there is encrypting technology is available in the windows operating system.
Answer:
default gateway
Explanation:
A default gateway in a computer network environment means the access point through which a networked device uses to send or receive information from another network. Default gateways make it possible to exchange information from a local network to an outside network. So simply they serve as the interface through which communication is made with external networks or the internet.
Answer:
p(x,n)
1. if(n==0) [if power is 0]
2. then result =1.
3.else
4. { result=1.
5. for i=1 to n.
6. { result = result * x. } [each time we multiply x once]
7. return result.
8. }
Let's count p(3,3)
3
0, so come to else part.
i=1: result = result *3 = 3
i=2: result = result *3 = 9
i=2: result = result *3 = 27
Explanation:
here the for loop at step 4 takes O(n) time and other steps take constant time. So overall time complexity = O(n)
