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
Answer: a. intrapersonal and short-term goals
Explanation:
Intrapersonal goals are those that we set for ourselves in our minds to accomplish. The students that are finishing their homework after school most probably set that goal in their minds and so meeting it would mean meeting their intrapersonal goals.
Homework is not a long term project but rather a short one that is usually meant to be completed within days. Completing it is therefore a short term goal.
The students who finish their homework after school are therefore accomplishing both their intrapersonal and short-term goals.
Answer:
Code is too large , i attached a source file below and also a text file from where i get Questions
Explanation:
Follow these steps.
1. Make sure that your pc is on.
2. Press your Window key - on your bottom left of your keyboard you will see a window key.
3. After pressing it will show a tab on your bottom left of your monitor.
4. On that tab you will see an (All Programs) text.
5. Click it and it will show all programs available on your pc.
