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).
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).
Show Hint
Solution and Explanation
Top Questions on Programming in C
What is the output of the following code fragment?
int x = 24;}
printf("%d\n", x);
printf("%3d %3d\n", x, x);}
- GATE CS - 2025
- Programming and Data Structure
- Programming in C
Consider the following C program
The value printed by the given C program is _________ (Answer in integer).- GATE CS - 2025
- Programming and Data Structure
- Programming in C
Match the following layers with their corresponding functionalities:
\[ \begin{array}{|c|c|} \hline \textbf{Layer} & \textbf{Functionality} \\ \hline \text{Networking Layer} & \text{Data packet transfer} \\ \text{Transport Layer} & \text{Host-to-host communication} \\ \text{Data Link Layer} & \text{Error detection and correction} \\ \hline \end{array} \]- GATE CS - 2025
- Programming and Data Structures
- Programming in C
Let \( A \) be a \( 3 \times 3 \) matrix defined as:
\[ A = \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & -1 \end{bmatrix} \]Find the eigenvalues of \( A^{13} \).
- GATE CS - 2025
- Programming and Data Structures
- Programming in C
Questions Asked in GATE CS exam
A disk of size 512M bytes is divided into blocks of 64K bytes. A file is stored in the disk using linked allocation. In linked allocation, each data block reserves 4 bytes to store the pointer to the next data block. The link part of the last data block contains a NULL pointer (also of 4 bytes). Suppose a file of 1M bytes needs to be stored in the disk. Assume, 1K = \(2^{10}\) and 1M = \(2^{20}\). The amount of space in bytes that will be wasted due to internal fragmentation is ___________. (Answer in integer)
- GATE CS - 2025
- Memory hierarchy
- Given the sequence: \( 5, 6, 15, \_, 89, 170, 291 \), find the missing number.
- GATE CS - 2025
- Logical and Analytical Reasoning Skills
- Consider a five-digit number PQRST that has distinct digits P, Q, R, S, and T, and satisfies the following conditions:
1. \( P<Q \)
2. \( S>P>T \)
3. \( R<T \)
If integers 1 through 5 are used to construct such a number, the value of P is:- GATE ST - 2025
- GATE CS - 2025
- GATE MN - 2025
- GATE XE - 2025
- GATE XL - 2025
- mathematical reasoning
Three villages P, Q, and R are located in such a way that the distance PQ = 13 km, QR = 14 km, and RP = 15 km, as shown in the figure. A straight road joins Q and R. It is proposed to connect P to this road QR by constructing another road. What is the minimum possible length (in km) of this connecting road?
Note: The figure shown is representative.
- A business person buys potatoes of two different varieties P and Q, mixes them in a certain ratio and sells them at ₹192 per kg.
The cost of the variety P is ₹800 for 5 kg.
The cost of the variety Q is ₹800 for 4 kg.
If the person gets 8% profit, what is the P : Q ratio (by weight)?