List of top Questions asked in Tamil Nadu Common Entrance Test

Which one of the following is the ability to represent all kinds of knowledge that are needed in that domain?
For a function of two variables, boundary value analysis yields:
The reason for the uncertainty in the Wumpus World Problem is that the agent’s sensor provides only the following information.
If \( P \) is risk probability, \( L \) is loss, then Risk Exposure (RE) is computed as:
The number of levels used in defining a knowledge-based agent is
Which test refers to the retesting of a unit, integration and system after modification, in order to ascertain that the changes have not introduced new faults?
All activities lying on the critical path have slack time equal to:
A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output bit-string after stuffing is 01111100101, then the input bit-string is
Which of the following is a semi join?
If 5 TCP segments of 100-byte MSS are sent consecutively, starting with sequence number 101, 201, 301, 401, and 501, and if the first segment is lost, the ACKs returned will have ACK numbers as:
Which of the following is not a clustering method?
Which of the following is the characteristic of RAID-5?
The transfer function of a Butterworth filter is given by:
What is the maximum size of data that the application layer can pass on to the TCP layer below?
Low pass Butterworth filters are:
The number of additions required to compute N-point DFT using radix-2 FFT is given by:
A channel has \( B = 4 \) KHz, what is the channel capacity having the signal-to-noise ratio of 20 dB?
Fast Fourier Transform algorithms exploit:
What is the formula for Hit Ratio?
The elimination stage of WAR and WAW hazards is often called:
In the absolute addressing mode:
A greedy algorithm is an approach for solving a problem by:
Recursive algorithm like Merge Sort cannot use Dynamic Programming because:
What is the recurrence for the worst case of quicksort, and what is the time complexity in the worst case?
Let \( S \) be an NP-complete problem and \( Q \) and \( R \) be two other problems not known to be in NP. \( Q \) is polynomial-time reducible to \( S \) and \( S \) is polynomial-time reducible to \( R \). Which one of the following statements is true?