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
Local server so you can all you use if you guys are near
Answer:
Correct option C
Trimmed mean
Explanation:
A trimmed mean is a method of averaging that removes a small designated percentage of the largest and smallest values before calculating the mean.
Trimmed mean helps eliminate the influence of data points on the tails that may unfairly affect the traditional mean.
Trimmed means are used in reporting economic data in order to smooth the results and paint a more realistic picture.