List of top Questions asked in CUET (PG)

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

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.

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

Arrange the following steps in the correct order to understand the functioning of a 3 to 8 line decoder.
(A) The encoder enable input is set to 1.
(B) The decoder activates one of its 8 output lines based on the input code.
(C) The input binary code is applied to the decoder.
(D) The decoder converts the 3-bit binary input into 8 possible outputs.

Perform the arithmetic addition of the two decimal numbers given in List-I using the signed-complement system. Match the corresponding output of List-I with binary number representation given in List-II.
\[\begin{array}{|c|c|}\hline \text{List-I} & \text{List-II} \\ \hline \text{(A) +6, +13} & \text{(I) 00000111} \\ \hline \text{(B) -6, +13} & \text{(II) 00010011} \\ \hline \text{(C) +6, -13} & \text{(III) 11101011} \\ \hline \text{(D) +6, -13} & \text{(IV) 11111101} \\ \hline \end{array}\]

Consider the following types of memories.
(A) Hard Disk Drive (HDD)
(B) Cache Memory
(C) Random Access Memory (RAM)
(D) Registers
Arrange the above memories according to their access speed (from fastest to slowest):

Consider the following Karnaugh Map (K-map). Minimal Function generated by this Karnaugh map is:

Given the index i of a node in a heap, we can not compute:

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

The Quicksort and randomized Quicksort procedures differ in:

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?

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.

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

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

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

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:

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

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:

Which of the following is not an application of DFS?

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