List of top Computer Science Questions asked in CUET (PG)

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

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}$

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.

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 (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:

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

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

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

In a binary search tree, the worst case time complexity of inserting and deleting a key is:

Which of the following is a way to recover from the deadlock which has already occurred?

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

Minimum number of 2:1 Multiplexers required to design a 16:1 Multiplexer is?

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{FCFS} & (III)\ \text{Often long average waiting time} \\ \hline (B)\ \text{Round Robin} & (I)\ \text{FCFS + preemption} \\ \hline (C)\ \text{Multi-level queue scheduling} & (IV)\ \text{Permanent assignment of processes to one specific queue} \\ \hline (D)\ \text{Multi-level Feedback Queue} & (II)\ \text{Allows the processes to move between queues} \\ \hline \end{array}\] Choose the correct answer from the options given below:

Which of the following is not an application of DFS?

Details of a paging system for memory management are as follows:
Logical address space: 32 KB
Page Size: 4 KB
Physical Memory size: 64 KB
The number of pages in the logical address space and number of page frames in physical memory, respectively, are:

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.

Out of 5 consonants and 4 vowels, how many words of 3 consonants and 3 vowels can be made?

Which CPU scheduling algorithm prefers the process with the shortest burst time?

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

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

If the line through $ (3, y) $ and $ (2, 7) $ is parallel to the line through $ (-1, 4) $ and $ (0, 6) $, then the value of $ y $ is:

If $ a, b, c $ are in Geometric Progression and $ a^x = b^y = c^z $, then $ x, y, z $ are in: