If \( x^2 = -16y \) is an equation of a parabola, then:
(A) Directrix is \( y = 4 \)
(B) Directrix is \( x = 4 \)
(C) Co-ordinates of focus are \( (0, -4) \)
(D) Co-ordinates of focus are \( (-4, 0) \)
(E) Length of latus rectum is 16
Step 1: Standard form of the parabola.
The given equation \( x^2 = -16y \) is a parabola that opens downwards. The standard form for a parabola opening downwards is:
\[
x^2 = -4ay
\]
By comparing, we see that \( 4a = 16 \), so \( a = 4 \).
Step 2: Find the focus and directrix.
- The focus is at \( (0, -a) = (0, -4) \).
- The directrix is given by \( y = a = 4 \).
Step 3: Find the length of the latus rectum.
The length of the latus rectum for a parabola is \( 4a \), which is \( 16 \).
Thus, the correct answer is 3. (A), (C) and (E) only.
Two parabolas have the same focus $(4, 3)$ and their directrices are the $x$-axis and the $y$-axis, respectively. If these parabolas intersect at the points $A$ and $B$, then $(AB)^2$ is equal to:
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.