Answer: True
Explanation:
The definition of minimum spanning tree(MST) says that the graph must be connected and undirected to be considered for MST. It has (V-1) edges where V is the number of vertices. The minimum spanning tree is implemented using Kruskal's algorithm whereby it starts by considering the minimum weighted edge and covers all the edges upto (V-1) edges. So for MST it has to be connected
making a selection in the Save in: box.<span>
</span>
Answer:
a) Generate a new public and private key
Explanation:
You encrypt a message using the recipient's public key and the recipient decrypts the message using his own private key. Only the public key can be known by an external agent. The private key is for the individual and is not expected to be shared. In the event that the recipient cannot decrypt the message, it is unsafe to send one's private key to him. He does not even need one's private key to decrypt the message, he needs his own private key.
The best thing to do is to generate another means of security by generating new public and private key so that the sender encrypts the message with the new public key and the receiver decrypts it using his new private key.
Option B is wrong because, if the encryption is removed, the aim, which is to secure the message from intruders is not achieved.
Answer:
it can be hacked
Explanation:
there is always a chance for computer data to be hacked
Answer:
breaking a problem into smaller parts
Explanation:
In language of computer science, decomposition is the process in which complex problems are divided into simpler parts. These simpler parts helps in the solving of the complex problems. They are made easier and comprehensible for the user to understand. Each simple part is further analyzed separately and the solution of the complex issues are derived. The process becomes lengthy but the solution is found.
