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

If \( x = \left( 2 + \sqrt{3} \right)^3 + \left( 2 - \sqrt{3} \right)^{-3} \) and \( x^3 - 3x + k = 0 \), then the value of \( k \) is:

All the elements that hash to the same slot are placed into the same linked list in:
In case of Binary Search Tree, which of the following procedure's running time is distinct among all?
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:

The following circuit generates the same output as? 

In an examination, a student scores 4 marks for every correct answer and loses 1 mark for every wrong answer. If she/he attempts all 60 questions and secures 130 marks, the number of questions she/he attempts wrongly are?
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
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:
What should be the minimum Hamming distance \( d_{\text{min}} \) to guarantee correction of up to p errors in a given block code?
\[ \int \frac{2x+1}{x^{2}+x+2}\, dx \ \text{ is} \]
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}\]

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 __________. 
 

In ................. the search time is independent of the number of elements $n$.
A situation where two or more processes are blocked, waiting for resources held by each other is called:

The statements of pseudocode for searching the first element with key k in the linked list L are given below. Arrange them in the correct order. 
(A) while (x != NIL and x.key != k) 
(B) x = L.head 
(C) x = x.next 
(D) return x 

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:
To provide a memory capacity of 32K X 16 how many address lines and data lines are required?
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.
If \( a, b, c \) are in Geometric Progression and \( a^x = b^y = c^z \), then \( x, y, z \) are in:
The center and radius for the circle \( x^2 + y^2 + 6x - 4y + 4 = 0 \) respectively are:

The points \( (K, 2 - 2K), (-K + 1, 2K) \) and \( (-4 - K, 6 - 2K) \) are collinear if: 

(A) \( K = \frac{1}{2} \) 
(B) \( K = -\frac{1}{2} \) 
(C) \( K = \frac{3}{2} \) 
(D) \( K = -1 \) 
(E) \( K = 1 \) 
 

Arrange the following time complexities in increasing order.
(A). Bubble sort (worst case)
(B). Deleting head node in singly linked list
(C). Binary search
(D). Worst case of merge sort
What should be the output of the following boolean expression after simplifying it to a minimum number of variables? \[ a'b' + ab + a'b \]
Which of the following statements are TRUE, where $|E|$ represents the number of edges?
(A). In case of a directed graph, the sum of lengths of all the adjacency list is |E|
(B). For an undirected graph, the sum of the lengths of all the adjacency list is 2|E|
(C). For a dense graph, adjacency matrix representation is preferable
(D). The memory requirement of the adjacency matrix of a graph is dependent on the number of edges