Explanation:
The statement which says that a graph is complete means an undirected graph whose every pair of vertices is connected by an particular edge or unique edge.
An undirected graph is a graph whose edges soea not contain any direction means to which vertex they are directed.
A complete graph has an edge between every pair of vertices that exist in that graph.
Answer:
Currently running process
Explanation:
In preemptive priority scheduling there is usually a form of comparison of the schedule with the other function or processes which are present in the queue also.
In preemptive priority scheduling, when a process arrives at the ready queue, its priority is compared with the priority of currently running process.
