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

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 

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.
In case of Binary Search Tree, which of the following procedure's running time is distinct among all?
To provide a memory capacity of 32K X 16 how many address lines and data lines are required?
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}\]
In ................. the search time is independent of the number of elements $n$.
All the elements that hash to the same slot are placed into the same linked list in:

The following circuit generates the same output as? 

\[ \int \frac{2x+1}{x^{2}+x+2}\, dx \ \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 
 

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:
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:
Out of 5 consonants and 4 vowels, how many words of 3 consonants and 3 vowels can be made?
What should be the output of the following boolean expression after simplifying it to a minimum number of variables? \[ a'b' + ab + a'b \]
A fair coin is tossed three times. Let A be the event of getting exactly two heads and B be the event of getting at most two tails, then \( P(A \cup B) \) is:
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 \) 
 

The Quicksort and randomized Quicksort procedures differ in:
The Dining Philosopher problem can be solved by:
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

Find the number of triangles in the given figure.

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