List of practice Questions

Four companies C1, C2, C3, C4 must interview candidates P, Q, R, S over four time slots (T1--T4).
Each candidate gets one unique slot and each company interviews exactly one candidate per slot.
Constraints:
1. P cannot be interviewed by C1 or C3.
2. Q must be interviewed in either T1 or T4.
3. R must be interviewed before S.
4. C4 only interviews in T2 or T3.
5. No company interviews the same candidate as last year:
(C1--P), (C2--Q), (C3--R), (C4--S).
How many valid interview schedules are possible?

Four teams T1, T2, T3, T4 play a tournament where each team plays exactly two matches.
Rules:
1. No match ends in a draw.
2. T1 defeats T3.
3. T4 plays exactly one match before it plays T2.
4. T2 wins exactly one match.
5. T3 does not defeat T4.
6. Total matches = 4.
How many valid sequences of wins/losses across all matches are possible?

If $M$ and $N$ are square matrices of order 3 such that $\det(M) = m$ and $MN = mI$, then $\det(N)$ is equal to :

If \( \frac{1}{9!} + \frac{1}{10!} = \frac{x}{11!} \), then the value of \( x \) is:

Match List-I with List-II.\[\begin{array}{|c|c|} \hline \textbf{List-I} & \textbf{List-II} \\ \hline (A) \; \text{If } A = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}, \; \Delta \text{ is} & (I) \; 0 \\ \hline (B) \; \text{If } A = \begin{bmatrix} 2 & 1 \\ 4 & 2 \end{bmatrix}, \; \Delta \text{ is} & (II) \; 1 \\ \hline (C) \; \text{If } A = \begin{bmatrix} 1 & 0 \\ 0 & 2 \end{bmatrix}, \; |A^{-1}| \text{ is} & (III) \; -2 \\ \hline (D) \; \text{If } A = \begin{bmatrix} 1 & 1 \\ 1 & 2 \end{bmatrix}, \; a \text{ is} & (IV) \; 2 \\ \hline \end{array}\]

If \[ \frac{1}{a(b + c)} + \frac{1}{b(c + a)} + \frac{1}{c(a + b)} = k, \text{ then the value of } k \text{ is:} \]

The value of $\displaystyle \lim_{x \to \infty}\left(1+\frac{2}{3x}\right)^{x}$ is:

\[ \int \frac{2x+1}{x^{2}+x+2}\, dx \ \text{ is} \]

Bag $A$ contains 3 Red and 4 Black balls while Bag $B$ contains 5 Red and 6 Black balls. One ball is drawn at random from one of the bags and is found to be Red. Then, the probability that it was drawn from Bag $B$ is:

Match List-I with List-II:
\[\begin{array}{|c|c|} \hline \textbf{List-I} & \textbf{List-II} \\ \hline \text{(A)}\ \lim_{x\to 0}(1+2x)^{\frac{1}{x}} & \text{(I)}\ e^{6} \\ \hline \text{(B)}\ \lim_{x\to \infty}\left(1+\frac{1}{x}\right)^{x} & \text{(II)}\ e^{2} \\ \hline \text{(C)}\ \lim_{x\to 0}(1+5x)^{\frac{2}{x}} & \text{(III)}\ e \\ \hline \text{(D)}\ \lim_{x\to \infty}\left(1+\frac{3}{x}\right)^{2x} & \text{(IV)}\ e^{5} \\ \hline \end{array}\] Choose the correct answer from the options given below:

Which of the following scheduler/schedulers is/are also called CPU scheduler?
(A) Short Term Scheduler
(B) Long Term Scheduler
(C) Medium Term Scheduler
(D) Asymmetric Scheduler
Choose the correct answer from the options given below:

A situation where two or more processes are blocked, waiting for resources held by each other is called:

External fragmentation occurs .................. .

Which disk scheduling algorithm looks for the track closest to the current head position?

Consider a page reference string as: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2. Assume that there are 3-page frames available. Calculate the total number of page faults for the above reference string if LRU policy is used for page replacement.

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{Seek Time} & (IV)\ \text{Time taken for the disk arm to move the heads to the cylinder containing the desired sector} \\ \hline (B)\ \text{Access Time} & (III)\ \text{Seek Time + Rotational Latency} \\ \hline (C)\ \text{Rotational Latency} & (II)\ \text{Time taken for the disk to rotate the desired sector to the disk head} \\ \hline (D)\ \text{Disk Bandwidth} & (I)\ \text{Total number of bytes transferred, divided by the total time between the first request for service and the completion of the last transfer} \\ \hline \end{array}\] Choose the correct answer from the options given below:

Consider a typical process P in the critical section. Arrange the following statements of code to make a valid general structure.
(A). Critical section
(B). Remainder section
(C). Entry section
(D). Exit section

Arrange the following layers of MS DOS operating system starting from inner most to outer most.
(A). ROM BIOS Device drivers
(B). Resident System Program
(C). MS DOS Device Drivers
(D). Application Program