List of top Questions asked in CUET (PG)

In case of Binary Search Tree, which of the following procedure's running time is distinct among all?

All the elements that hash to the same slot are placed into the same linked list in:

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:

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

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

Arrange the following steps in the correct order to understand the functioning of a 3 to 8 line decoder.
(A) The encoder enable input is set to 1.
(B) The decoder activates one of its 8 output lines based on the input code.
(C) The input binary code is applied to the decoder.
(D) The decoder converts the 3-bit binary input into 8 possible outputs.

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

What should be the minimum Hamming distance \( d_{\text{min}} \) to guarantee correction of up to p errors in a given block code?

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:

In ................. the search time is independent of the number of elements $n$.

The value of $\displaystyle \lim_{x \to \infty}\left(1+\frac{2}{3x}\right)^{x}$ 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:

Consider the following statements.
(A) Combinational logic circuits do not have memory, while sequential logic circuits have memory elements.
(B) Sequential logic circuits depend only on the current inputs, while combinational logic circuits depend on both current and past inputs.
(C) Flip-flops and latches are examples of combinational logic circuits.
(D) Multiplexer is an example of combinational logic circuit.

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}\]

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{Binary Search} & (I)\ T(n) = T(n/2) + c \\ \hline (B)\ \text{Merge Sort} & (II)\ T(n) = 2T(n/2) + \Theta(n) \\ \hline (C)\ \text{Quick Sort (worst case)} & (III)\ T(n) = T(n-1) + \Theta(n) \\ \hline (D)\ \text{Linear Search} & (IV)\ T(n) = T(n-1) + c \\ \hline \end{array}\] 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:

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{BFS} & (IV)\ \text{Queue} \\ \hline (B)\ \text{DFS} & (I)\ \text{Stack} \\ \hline (C)\ \text{Heap Sort} & (III)\ \text{Priority Queue} \\ \hline (D)\ \text{Storage on secondary storage devices} & (II)\ \text{B Trees} \\ \hline \end{array}\] Choose the correct answer from the options given below:

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:} \]

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