List of top Questions asked in CUET (PG)- 2025

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
A situation where two or more processes are blocked, waiting for resources held by each other is called:

Complete the following statement by choosing the correct option. 

For a deadlock to occur, the four conditions namely Mutual Exclusion, Hold and Wait, No preemption, Circular wait __________. 
 

Consider the following Karnaugh Map (K-map). Minimal Function generated by this Karnaugh map is: 

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.
In case of Binary Search Tree, which of the following procedure's running time is distinct among all?
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
To provide a memory capacity of 32K X 16 how many address lines and data lines are required?
The value of $\displaystyle \lim_{x \to \infty}\left(1+\frac{2}{3x}\right)^{x}$ is:
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:
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:
What should be the minimum Hamming distance \( d_{\text{min}} \) to guarantee correction of up to p errors in a given block code?
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.

Perform the arithmetic addition of the two decimal numbers given in List-I using the signed-complement system. Match the corresponding output of List-I with binary number representation given in List-II. 
\[\begin{array}{|c|c|}\hline \text{List-I} & \text{List-II} \\ \hline \text{(A) +6, +13} & \text{(I) 00000111} \\ \hline \text{(B) -6, +13} & \text{(II) 00010011} \\ \hline \text{(C) +6, -13} & \text{(III) 11101011} \\ \hline \text{(D) +6, -13} & \text{(IV) 11111101} \\ \hline \end{array}\]

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.
Which of the following statement is true about IEEE754 representation of +0 and -0?
Match List-I with List-II.\[\begin{array}{|c|c|}\hline \textbf{J K Flip Flop Inputs} & \textbf{Next State} \\ \hline (A)\ 0\ 0 & (I)\ \text{No Change} \\ \hline (B)\ 0\ 1 & (II)\ \text{Reset} \\ \hline (C)\ 1\ 0 & (III)\ \text{Set} \\ \hline (D)\ 1\ 1 & (IV)\ \text{Toggle} \\ \hline \end{array}\]
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:
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:
If \( \frac{1}{9!} + \frac{1}{10!} = \frac{x}{11!} \), then the value of \( x \) is:
If \( (x - 1) \) is a factor of \( 2x^2 - 5x + k = 0 \), then the value of \( k \) is:
Which disk scheduling algorithm looks for the track closest to the current head position?
External fragmentation occurs .................. .
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:
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:} \]