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:
The exec command by interpreter to start new process
Explanation:
On Unix systems, a call to the fork system must be made followed by a call to the e x e c system to begin a new process. The fork call clones the process that is currently running, while the executive call overlays a new process based on a different executable over the calling process.
It is seperate from Kernal because
It Read user commands or a script and execute them, generally turning them into one or more system calls. Is usual It is not part of the kernel since the command interpreter is subject to change.
