Step 1: Rewrite the equation of the circle in standard form.
The given equation is \( x^2 + y^2 + 6x - 4y + 4 = 0 \). We can complete the square for both \( x \) and \( y \).
- For \( x^2 + 6x \), we complete the square by adding and subtracting \( 9 \):
\[
x^2 + 6x = (x + 3)^2 - 9
\]
- For \( y^2 - 4y \), we complete the square by adding and subtracting \( 4 \):
\[
y^2 - 4y = (y - 2)^2 - 4
\]
So, the equation becomes:
\[
(x + 3)^2 - 9 + (y - 2)^2 - 4 + 4 = 0
\]
Simplifying:
\[
(x + 3)^2 + (y - 2)^2 = 9
\]
Step 2: Find the center and radius.
The equation is now in the form \( (x - h)^2 + (y - k)^2 = r^2 \), where \( (h, k) \) is the center and \( r \) is the radius.
Thus, the center is \( (-3, 2) \) and the radius is \( \sqrt{9} = 3 \).
Therefore, the correct answer is 3. (2, -3) and 3.
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.