List of top Questions asked in CUET (PG)

Match List I with List II.

LIST I	LIST II
(A) A* Algorithm	(I) Space complexity is O4, where d = depth of the deepest optimal solution.
(B) Recursive Best First Search	(II) Incomplete even if the search space is finite.
(C) Recursive Best First Search	(III) Optimal, if the optimal solution is reachable, otherwise returns the best reachable optimal solution.
(D) SMA* Algorithm	(IV) Computation and space complexity is too high.

Choose the correct answer from the options given below:

Match List I with List II

LIST I	LIST II
(A) lim_x→1(1 − x)^1/x	(I) e
(B) lim_x→0 1/x ln(1 − x)	(II) 1
(C) lim_x→0 (1 + x²)^1/x	(III) 0
(D) lim_x→∞ (1 + 1/x)^x	(IV) 2

Equation x² − 1 = 0 is required to be solved using Newton Raphson’s method with an initial guess x0 = −1. Then after one step of Newton’s method, the estimate x1 of the solution will be given by

Match List I with List II

LIST I	LIST II
(A) Floyd-Warshall algorithm for all pair shortest paths	(I) Divide and Conquer
(B) Prim’s algorithm	(II) Greedy Paradigm
(C) Hamiltonian Circuit	(III) Backtracking
(D) Merge Sort	(IV) Dynamic Programming paradigm

Choose the correct answer from the options given below:

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst-case running time of this computation is:

Which of the following statement(s) is/are not true?
1. Optimal binary search tree construction can be performed efficiently using dynamic programming.
2. BFS cannot be used to find connected components of a graph.
3. Given the prefix and postfix walks over the binary tree, the binary tree cannot be uniquely constructed.
4. DFS can be used to find connected components of a graph.
Choose the correct answer from the options given below:

Consider the quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists, one of which contains one-fifth of the elements and the remaining elements are contained in the other sub-list. Let T(n) be the number of comparisons required to sort n elements. Then:

Let A be the problem of finding a Hamiltonian cycle in a graph G = (V, E) with |V| divisible by 3, and B be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true?

Rank the following functions by order of growth (Highest running time to lowest running time):
1. $n \times 3^n$
2. $2^{\log(n)}$
3. $n^{2/3}$
4. $4^n$
5. $4^{\log(n)}$
Choose the correct answer from the options given below:

Match List I with List II;

LIST I	LIST II
(A) Bucket sort	(I) O(n²)
(B) Matrix chain multiplication	(II) O(n³)
(C) Huffman codes	(III) O(n log n)
(D) Dijkstra’s Algorithm	(IV) O(n)

Choose the correct answer from the options given below:

Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is:

A hash function f defined as f(key) = key mod 7, with linear probing, is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6. What will be the location of key 11?

The worst-case time complexity of inserting a node in a doubly linked list is:

Consider the given two statements:
S1: Kruskal’s Algorithm might produce a non-minimal spanning tree.
S2: Kruskal’s Algorithm can be efficiently implemented using the disjoint set data structure.
Choose the correct answer from the options given below:

Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?
(A) 2
(B) 3
(C) 1
(D) 4
(E) 5
Choose the correct answer from the options given below:

Choose the correct answer from the options given below:
(A). RAID 3 requires only a single redundant disk.
(B) In RAID 4 scheme, two different parity calculations are carried out and stored in separate blocks on different disks.
(C) RAID 5 distributes the parity strips across all disks.
(D) In RAID 2, the number of redundant disks are proportional to the log of the number of data disks.

In a two-level memory hierarchy, the access time of the cache memory is 12 nsec and the access time of the main memory is 1.5 msec. The hit ratio is 0.98. What is the average access time of the two-level memory system?

A magnetic disk pack has the following specifications: 16 surfaces, 128 tracks per surface, 256 sectors per track, and 512 bytes per sector. Calculate the capacity of the disk pack.

The sequence of events that happen during a typical fetch operation is:
(A) MAR
(B) IR
(C) MDR
(D) Memory
(E) PC
Choose the correct answer from the options given below:

Which is not a requirement of digital signatures:

Rail fence technique is an example of:

In the DES algorithm, the round input is 32 bits, which is expanded to 48 bits via:

The best-known multiple-letter encryption cipher is:

Computation of the discrete logarithm is the basis of the cryptographic system:

In which theorem \(a^{p−1} = 1 \) mod p where p is prime and a is a positive integer not divisible by p