Consider the following table of arrival and burst time in ms for three processes P0, P1, and P2.
The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?
For which value of $ x $, the matrix $ A $ has no inverse where $$ A = \begin{pmatrix} 8 & x & 0 \\4 & 0 & 2 \\12 & 6 & 0 \end{pmatrix} $$
If $$ A = \begin{pmatrix} -5 & -8 & 0 \\3 & 5 & 0 \\1 & 2 & -1 \end{pmatrix} $$ then $ A^2 $ is:
The union and intersection of the graphs G and H are respectively