List of top Data Science A.I Cyber Security and Computer Sci. Questions asked in Common University Entrance Test

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:
The simultaneous equations on the Boolean variables x, y, z, and w are: x + y + z = 1, xy = 0, x + y + w = 1, xy + z = 0. The solution for x, y, z, and w, respectively, is:
Which of the following statements are not true?
An FPGA with an embedded logic function that cannot be programmed is said to be:
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 A2 are
Match List I with List II
LIST ILIST 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
Equation x2 − 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 ILIST II
(A) Unification(I) Variable can be done with a constant, another variable, or a function.
(B) Deep backtracking(II) The entire conjunctive goal is executed.
(C) Forward movement(III) Choose subgoal with possible unifier.
(D) Shallow backtracking(IV) Previous subgoal to find alternative solutions.
Consider the FOL sentence F: ∀x(∃y R(x, y)). Assuming non-empty logical domains, which of the sentences below are implied by F?
(A) ∃y(∃x R(x, y))
(B) ∃y(∀x R(x, y))
(C) ∀y(∃x R(x, y))
(D) ¬∃x(∀y ¬R(x, y))
Choose the correct answer from the options given below:
What is a perception check?
What is meant by factoring?
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)?
Let Σ be a finite non-empty alphabet and let 2Σ* be the power set of Σ*. Which one of the following is true?
Match List I with List II.
LIST ILIST 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:
Let P be a regular language and Q be a context-free language such that Q ⊆ P. Then which of the following is always regular?
Which of the following languages are context-free?
Finite Languages satisfy the pumping lemma by having n = .
Which of the following 'Laws' is Asimov’s first and most important law of robotics?
Deallocation of stack of thread and register contexts will take place.
Match List I with List II.
List IList II
A. SegmentationI. Memory is viewed as a collection of logical address spaces.
B. Unsegmented paged memoryII. Virtual address is the same as the physical address.
C. Segmented unpaged memoryIII. Memory is viewed as a paged linear address space.
D. Segmented paged memoryIV. Manages the allocation of memory within a partition.
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?
If L and L are recursively enumerable, then L is:
In case of DMA, after the completion of the transfer, the processor is required to be notified of the completion. This is done through.
Match List I with List II.
List IList II
A. Supervisor modeI. Entered when the processor encounters a software interrupt instruction
B. Abort ModeII. Entered in response to memory fault
C. Fast Interrupt ModeIII. Entered whenever the processor receives an interrupt signal from a designated fast interrupt source
D. Interrupt ModeIV. Entered whenever the processor receives an interrupt signal from any other source
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.