Step 1: Understanding the 9's complement.
To compute the 9's complement of a decimal number, subtract each digit from 9.
Step 2: Computing the 9's complement of 782.54.
For the integer part \( 782 \), subtract each digit from 9: - \( 9 - 7 = 2 \) - \( 9 - 8 = 1 \) - \( 9 - 2 = 7 \)
So, the 9's complement of 782 is 217.
For the fractional part \( .54 \), subtract each digit from 9: - \( 9 - 5 = 4 \) - \( 9 - 4 = 5 \)
Thus, the 9's complement of 782.54 is 216.45.
Therefore, the correct answer is (1) 216.54.
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.