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

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.

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:

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

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

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:

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:

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

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

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

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:

Which of the following is not an application of DFS?

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:

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.

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