List of top Questions asked in CUET (PG)

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

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

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:

If $\; f(x)=\begin{cases} x\sin\!\left(\tfrac{1}{x}\right), & x\neq 0 \\[6pt] 0, & x=0 \end{cases}, \; \text{then } f(x) \text{ is}$

If $ x^2 = -16y $ is an equation of a parabola, then:

(A) Directrix is $ y = 4 $
(B) Directrix is $ x = 4 $
(C) Co-ordinates of focus are $ (0, -4) $
(D) Co-ordinates of focus are $ (-4, 0) $
(E) Length of latus rectum is 16

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 $

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:

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

From the given sets, which is an infinite set:

Which figure comes next in the given series below?

In the following question, there is a certain relationship between two given words on one side of "::" and one word is given on another side of "::" while another word is to be found from the given options, having the same relation with this word as the words of the given pair bear. Choose the correct option to replace the '?'. Milk : Emulsion :: Butter : ?

Find the missing word (?) which is similar to the given words.

Introducing a man to her husband, a woman said, "His brother's father is the only son of my grandfather." How is the woman related to this man?

Identify the missing number (?) from the following figure.

Find the number of triangles in the given figure.

Find the next two terms of the series:
The given series is: $ A, C, F, J, ? $.

(A) O
(B) U
(C) R
(D) V
Choose the correct answer from the options given below:

What should be the output of the following boolean expression after simplifying it to a minimum number of variables? \[ a'b' + ab + a'b \]

To provide a memory capacity of 32K X 16 how many address lines and data lines are required?

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

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

The Quicksort and randomized Quicksort procedures differ in:

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

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

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

Consider the task of finding the shortest path in an unweighted graph by using BFS and DFS. Which of the following statements are true?
(A). BFS always finds the shortest path.
(B). DFS always finds the shortest path.
(C). DFS does not guarantee finding the shortest path.
(D). BFS does not guarantee finding the shortest path.