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
The central processing unit (CPU<span>) </span>works in conjunction<span> with </span><span>______ to perform processing</span>
Answer:
true
Explanation:
The command:
find -empty -type f -exec rm { } \;
carries out the following steps.
1) Finds all the empty files in the current directory and its subdirectories.
2) For each of the identified files, it executes the command specified as the parameter to exec option,namely, rm <filename>.
So effectively it removes all empty files in the directory tree starting at the current directory.
