List of top Data Science A.I Cyber Security and Computer Sci. Questions asked in CUET (PG)

Match List I with List II

LIST I	LIST II
(A) Circular Linked List	(I) Recursive Function Calls
(B) Doubly Linked List	(II) Round Robin Queue in CPU
(C) Stack	(III) Hash Tables
(D) Singly Linked List	(IV) Undo and Redo Functionality

Choose the correct answer from the options given below:

Match List I with List II.

List I	List II
A. Segmentation	I. Memory is viewed as a collection of logical address spaces.
B. Unsegmented paged memory	II. Virtual address is the same as the physical address.
C. Segmented unpaged memory	III. Memory is viewed as a paged linear address space.
D. Segmented paged memory	IV. Manages the allocation of memory within a partition.

Match List I with List II

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

Let Σ be a finite non-empty alphabet and let 2Σ* be the power set of Σ*. Which one of the following is true?

Typically, e-mail systems support five basic functions. Arrange them in sequence.
(A) Displaying
(B) Transfer
(C) Composition
(D) Disposition
(E) Reporting
Choose the correct answer from the options given below:

Which of the following is/are true about outliers?
(A) Linear Regression is not sensitive to outliers.
(B) Outliers can never be present in the test set.
(C) Outlier is a data point that is significantly close to other data points.
(D) The nature of our business problem determines how outliers are used.
Choose the correct answer from the options given below:

In an HTTP request message, the first line is called:

Match List I with List II

LIST I	LIST II
(A) Disk scheduling	(I) Round robin
(B) Batch processing	(II) SCAN
(C) Time sharing	(III) LIFO
(D) Interrupt processing	(IV) FIFO

Choose the correct answer from the options given below:

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:

Consider the following statements and choose the correct one:
(A) Job schedulers select processes from the pool and load them into memory for execution.
(B) Short term scheduler selects among the processes that are ready to execute and allocates the CPU to one of them.
(C) Medium term scheduler increases the degree of multiprogramming.
Choose the correct answer from the options given below:

The following data fragment occurs in the middle of the data stream for which the byte stuffing algorithm is used: A B ESC C ESC FLAG ESC FLAG D. What is the output after stuffing?

Let A be a 2 × 2 matrix with elements \(a_{11} = a_{12} = a_{21} = +1\) and \(a_{22} = −1\). Then the eigenvalues of matrix A² are

Ten signals, each requiring 4000 Hz, are multiplexed onto a single channel using FDM. How much minimum bandwidth is required for the multiplexed channel? Assume that the guard bands are 400 Hz wide.

If x ∈ [0, 1], and f(x) and g(x) are defined as: f(x) = sin(cos(πx/4)) and g(x) = cos(sin(πx/4)) then:

Deallocation of stack of thread and register contexts will take place.

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:

A system transmits a block of information containing ten packets each with eight data bits, a start bit, and a stop bit. Additional 'overhead' bits include a 4-bit synchronization code at the beginning of the block and a parity bit at the end of the block. What is the transmission efficiency?

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

Consider the following statements and choose the correct one:
(A) Segmentation is a memory management scheme that supports user view of memory.
(B) In paging, physical memory is broken into fixed-sized blocks called pages.
(C) In paging, logical memory is also broken into blocks of the same size called frames
Choose the correct answer from the options given below:

Consider a logical address space of eight pages of 1024 words each, mapped into a physical memory of 32 frames. How many bits are there in the logical address and in the physical address, respectively?

Consider a scenario in which DHCP clients and servers are on the same subnet. Here the communication between DHCP clients and servers will take place via:

In a Class B subnet, we know the IP address of one host and the mask as given below: IP address = 125.134.112.66 Mask = 255.255.224.0 What is the first address (Network address)?

Packet filtering firewalls are deployed on: