The points \( (K, 2 - 2K), (-K + 1, 2K) \) and \( (-4 - K, 6 - 2K) \) are collinear if:
(A) \( K = \frac{1}{2} \)
(B) \( K = -\frac{1}{2} \)
(C) \( K = \frac{3}{2} \)
(D) \( K = -1 \)
(E) \( K = 1 \)
Step 1: Condition for collinearity of points.
For the points to be collinear, the area of the triangle formed by them should be zero. The area \( A \) of a triangle with vertices \( (x_1, y_1), (x_2, y_2), (x_3, y_3) \) is given by the formula:
\[
A = \frac{1}{2} \left| x_1(y_2 - y_3) + x_2(y_3 - y_1) + x_3(y_1 - y_2) \right|
\]
Substitute the coordinates of the points into the formula and solve for \( K \). After simplifying, we find that \( K = \frac{1}{2} \) and \( K = -1 \) satisfy the condition. Therefore, the correct answer is 1. (A) and (D) only.
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.