Consider the following ANSI C program.
#include <stdio.h>
int main(){
int arr[4][5];
int i, j;
for (i=0; i<4; i++){
for (j=0; j<5; j++){
arr[i][j] = 10*i + j;
}
}
printf("%d", *(arr[1] + 9));
return 0;
} What is the output of the above program?
Step 1: Understand array initialization.
The array \(\texttt{arr[4][5]}\) is filled using the formula
\[
arr[i][j] = 10i + j.
\]
So the second row (\(i = 1\)) becomes:
\[
arr[1] = \{10, 11, 12, 13, 14\}.
\]
Step 2: Pointer interpretation of \(\texttt{arr[1]}\).
In C, \(\texttt{arr[1]}\) points to the first element of the second row, i.e., \(&arr[1][0]\).
Step 3: Evaluate the expression \(\texttt{*(arr[1] + 9)}\).
Since each row has 5 elements, adding 9 moves the pointer as follows:
\[
arr[1] + 9 = &arr[1][9] = &arr[2][4].
\]
Step 4: Find the value at \(\texttt{arr[2][4]}\).
Using the formula:
\[
arr[2][4] = 10 \times 2 + 4 = 24.
\]
Step 5: Final output.
The \(\texttt{printf}\) statement prints the value \(\texttt{24}\).
Consider the following C program
The value printed by the given C program is __________ (Answer in integer).
Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into the I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its lifetime (not counting the time the process enters the ready queue when it is run initially) is _________ (Answer in integer).

Arrange the following data types available in C language according to their size (smallest to largest):
A. signed long int
B. long double
C. unsigned char
D. unsigned int
Choose the correct answer from the options given below:
Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[ \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\ \hline P1 & 0 & 10 \\ P2 & 1 & 13 \\ P3 & 2 & 6 \\ P4 & 8 & 9 \\ \hline \end{array} \]Find the turnaround time for each process.
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
Consider the following C code segment:
int x = 126, y = 105;
do {
if (x > y)
x = x - y;
else
y = y - x;
} while (x != y);
printf("%d", x);
The output of the given C code segment is ____________. (Answer in integer)
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________ (answer in integer).
The value printed by the given C program is __________ (Answer in integer).